wanyu/IteraTeR_v2 huggingface dataset:
Original:  In the first stage, we first predict initial keypoint correspondences via a uniform acceleration motion model and then robustly establish the correspondences via a pyramid-based sparse optical flow tracking method .
Revised:  In the first stage, we first predict initial keypoint correspondences via a uniform acceleration motion model and then robustly establish the correspondences via pyramid-based sparse optical flow tracking method .
Edit intent: fluency
Original:  In the first stage, we first predict initial keypoint correspondences via a uniform acceleration motion model and then robustly establish the correspondences via a pyramid-based sparse optical flow tracking method .
Revised:  In the first stage, we first predict initial keypoint correspondences via a uniform acceleration motion model and then robustly establish the correspondences via a pyramid-based sparse optical flow tracking .
Edit intent: clarity
Original:  In the second stage, we leverage  motion smoothness and the epipolar constraint to refine the correspondences.
Revised:  In the second stage, we leverage the constraints of the motion smoothness and the epipolar constraint to refine the correspondences.
Edit intent: clarity
Original:  We test FastORB-SLAM with an RGBD camera on TUM and ICL-NUIM  datasets and compare its accuracy and efficiency to nine existing RGBD SLAM methods.
Revised:  We test FastORB-SLAM on TUM and ICL-NUIM datasets and compare its accuracy and efficiency to nine existing RGBD SLAM methods.
Edit intent: clarity
Original:  We test FastORB-SLAM with an RGBD camera on TUM and ICL-NUIM  datasets and compare its accuracy and efficiency to nine existing RGBD SLAM methods.
Revised:  We test FastORB-SLAM with an RGBD camera on TUM and ICL-NUIM datasets and compare its accuracy and efficiency to nine existing RGB-D SLAM methods.
Edit intent: fluency
Original:  Qualitative and quantitative results show that our method achieves state-of-the-art performance in accuracy and is about twice as fast as the ORB-SLAM2 
Revised:  Qualitative and quantitative results show that our method achieves state-of-the-art accuracy and is about twice as fast as the ORB-SLAM2 
Edit intent: clarity
Original:  Qualitative and quantitative results show that our method achieves state-of-the-art performance in accuracy and is about twice as fast as the ORB-SLAM2 
Revised:  Qualitative and quantitative results show that our method achieves state-of-the-art performance in accuracy and is about twice as fast as the ORB-SLAM2 .
Edit intent: fluency
Original:  In addition, \mbox{ DBLP:journals/corr/abs-2002-07152  algorithm yielding a +8W_{max} spanner of size O(n^{4/3}), here W_{max} is the maximum edge weight in the entire graph.
Revised:  In addition, \mbox{ DBLP:journals/corr/abs-2002-07152 showed an algorithm yielding a +8W_{max} spanner of size O(n^{4/3}), here W_{max} is the maximum edge weight in the entire graph.
Edit intent: clarity
Original: The free energy principle  in the neurosciences stipulates that all viable agents embody and minimize informational free energy  to fit their environmental niche.
Revised: The free energy principle in the neurosciences stipulates that all viable agents induce and minimize informational free energy to fit their environmental niche.
Edit intent: clarity
Original:  We implement free energy minimization in a more physically principled manner by effectively casting it to Bayesian control dynamics.
Revised:  In this study, we continue our effort to make the FEP a more physically principled manner by effectively casting it to Bayesian control dynamics.
Edit intent: clarity
Original: We propose a new algorithm for blind source separation of convolutive mixtures using independent vector analysis  .
Revised: We propose a new algorithm for blind source separation (BSS) using independent vector analysis .
Edit intent: clarity
Original:  This is an improvement over the popular auxiliary function based independent vector analysis (AuxIVA) with iterative projection (IP) or iterative source steering (ISS).
Revised:  This is an improvement over the popular auxiliary function based IVA (AuxIVA) with iterative projection (IP) or iterative source steering (ISS).
Edit intent: clarity
Original:  We introduce iterative projection with adjustment (IPA), whereas we update one demixing filter and jointly adjust all the other sources along its current direction.
Revised:  We introduce iterative projection with adjustment (IPA), where we update one demixing filter and jointly adjust all the other sources along its current direction.
Edit intent: coherence
Original:  We implement this scheme as multiplicative updates by a rank-2 perturbation of the identity matrix.
Edit intent: coherence
Original:  We find that the global minimum of an LQPQM can be efficiently computed.
Edit intent: coherence
Original:  We propose a simple procedure based on Newton-Raphson seeded with a good initial point to efficiently compute it.
Revised:  We propose a simple procedure based on Newton-Raphson to efficiently compute it.
Edit intent: coherence
Original:  We validate the performance of the proposed method for blind acoustic source separation via numerical experiments with reverberant speech mixtures .
Revised:  Numerical experiments demonstrate the effectiveness of the proposed method for blind acoustic source separation via numerical experiments with reverberant speech mixtures .
Edit intent: clarity
Original:  The differences in prediction accuracy between our personalized models and unpersonalized models are at least as large as the differences between unpersonalized models and a simple baseline.
Edit intent: clarity
Original:  As an application, we obtain, for any positive integer k, a partial  function on n bits that has bounded-error quantum query complexity at most \lceil k/2\rceil and randomized query complexity \Omega(n^{1-1/k}).
Revised:  As an application, we obtain, for any positive integer k, a partial Boolean function on n bits that has bounded-error quantum query complexity at most \lceil k/2\rceil and randomized query complexity \Omega(n^{1-1/k}).
Edit intent: fluency
Original:  As an application, we obtain, for any positive integer k\geq1 , a partial Boolean function on n bits that has bounded-error quantum query complexity at most \lceil k/2\rceil and randomized query complexity \Omega(n^{1-1/k}).
Revised:  As an application, we obtain, for every integer k\geq1 , a partial Boolean function on n bits that has bounded-error quantum query complexity at most \lceil k/2\rceil and randomized query complexity \Omega(n^{1-1/k}).
Edit intent: clarity
Original: Besides position bias, which has been well-studied, trust bias is another type of bias prevalent in user interactions with rankings: users are more likely to click incorrectly w.r.t. \ their preferences on highly ranked items because they trust the ranking system.
Revised: Besides position bias, which has been well-studied, trust bias is another type of bias prevalent in user interactions with rankings: users are more likely to click incorrectly w.r.t. their preferences on highly ranked items because they trust the ranking system.
Edit intent: fluency
Original:  Furthermore, we show that our estimator is a generalization of the existing (CLTR ) framework: if no trust bias is present, it reduces to the original (IPS ) estimator.
Revised:  Furthermore, we show that our estimator is a generalization of the existing CLTR framework: if no trust bias is present, it reduces to the original (IPS ) estimator.
Edit intent: fluency
Original:  Furthermore, we show that our estimator is a generalization of the existing (CLTR ) framework: if no trust bias is present, it reduces to the original (IPS ) estimator.
Revised:  Furthermore, we show that our estimator is a generalization of the existing (CLTR ) framework: if no trust bias is present, it reduces to the original IPS estimator.
Edit intent: fluency
Original:  Our semi-synthetic experiments indicate that by removing the effect of trust bias in addition to position bias, (CLTR ) can approximate the optimal ranking system even closer than previously possible.
Revised:  Our semi-synthetic experiments indicate that by removing the effect of trust bias in addition to position bias, CLTR can approximate the optimal ranking system even closer than previously possible.
Edit intent: clarity
Original:  Through extensive computer simulations, we examine how the cost of maintaining precautionary measures as well as the extent of mass testing in a population affects the final fraction of proactive individuals.
Revised:  Through extensive computer simulations, we examine that the cost of maintaining precautionary measures as well as the extent of mass testing in a population affects the final fraction of proactive individuals.
Edit intent: fluency
Original:  Through extensive computer simulations, we examine how the cost of maintaining precautionary measures as well as the extent of mass testing in a population affects the final fraction of proactive individuals.
Revised:  Through extensive computer simulations, we examine how the cost of maintaining precautionary measures as well as the extent of mass testing in a population affects the final fraction of socially responsible individuals.
Edit intent: clarity
Original:  This task focuses on hierarchical multi-label urban sound tagging with spatiotemporal context.
Revised:  This task focuses on hierarchical multilabel urban sound tagging with spatiotemporal context.
Edit intent: fluency
Original:  The code is available to our GitHub repository at URL
Revised:  The code is available on our GitHub repository at URL
Edit intent: style
Original: This work uses projective mapping with n=349 consumers to evaluate nine commercial chocolate chips cookies , including a blind duplicate of a multinational best-selling brand and seven private labels.
Revised: This work uses projective mapping with n=349 consumers to evaluate nine commercial chocolate chips cookies which include a blind duplicate of a multinational best-selling brand and seven private labels.
Edit intent: clarity
Original:  The results show that all the consensus graphics provide the same groups of samples, depending mostly on the proportion of chocolate chips, with the blind duplicates being correctly identified as the closest pair of samples, more clearly when using geometric techniques.
Revised:  All methods provide the same groups of samples, depending mostly on the proportion of chocolate chips, with the blind duplicates being correctly identified as the closest pair of samples, more clearly when using geometric techniques.
Edit intent: clarity
Original:  The results show that all the consensus graphics provide the same groups of samples, depending mostly on the proportion of chocolate chips, with the blind duplicates being correctly identified as the closest pair of samples, more clearly when using geometric techniques.
Revised:  The results show that all the consensus graphics provide the same groups of samples, with the blind duplicates being correctly identified as the closest pair of samples, more clearly when using geometric techniques.
Edit intent: coherence
Original: During disasters, crisis, and emergencies the public relies on online services provided by  authorities to receive timely alerts, trustworthy information, and access to relief programs.
Revised: During disasters, crisis, and emergencies the public relies on online services provided by official authorities to receive timely alerts, trustworthy information, and access to relief programs.
Edit intent: clarity
Original:  It is therefore crucial for the authorities to reduce risks when accessing their Web services.
Revised:  It is therefore crucial for the authorities to reduce risks when accessing their online services.
Edit intent: fluency
Original:  This includes proper naming (e.g., against phishing attacks), name protection (e.g., against forged DNS data), adequate identification (e.g., against spoofing and impersonation), and transport security (e. g., against traffic manipulation).
Revised:  This includes catering to secure identification of service, secure resolution of name to network service, and content security and privacy as a minimum base for trustworthy communication.
Edit intent: clarity
Original:  As an illustrative example, we investigate 1,388 Alerting Authorities , backed by the United States Federal Emergency Management Agency (US FEMA) .
Revised:  As an illustrative example, we investigate 1,388 Alerting Authorities .
Edit intent: coherence
Original:  Our analysis shows two major shortcomings : About 50\% of organizations do not own their dedicated domain names and are dependent on others, 55\% opt for unrestricted-use namespaces, which simplifies phishing, and less than 0.4 \% of unique AA domain names are secured by DNSSEC, which can lead to DNS poisoning and possibly to certificate misissuance.
Revised:  Our analysis shows two major shortcomings : About 50\% of organizations do not own their dedicated domain names and are dependent on others, 55\% opt for unrestricted-use namespaces, which simplifies phishing, and less than 4 \% of unique AA domain names are secured by DNSSEC, which can lead to DNS poisoning and possibly to certificate misissuance.
Edit intent: coherence
Original:  Furthermore, 15\% of all hosts provide none or invalid certificates, thus cannot cater to confidentiality and data integrity, 64\% of the hosts provide domain validation certificates that lack any identity information, and shared certificates have gained on popularity, which leads to fate-sharing and can be a cause for instability.
Revised:  Furthermore, 15\% of all hosts provide none or invalid certificates, thus cannot cater to confidentiality and data integrity, 64\% of the hosts provide domain validation certification that lack any identity information, and shared certificates have gained on popularity, which leads to fate-sharing and can be a cause for instability.
Edit intent: fluency
Original:  Our findings also lend strong support to the recent trend towards synthesizing %DIFDELCMD < {\em %DIFDELCMD < %%% edits of code conditional on the buggy context, to repair bugs.
Revised:  Our findings also lend strong support to the recent trend towards synthesizing %DIFDELCMD < {\em %DIFDELCMD < %%% edits of code conditional on the buggy context, to repair bugs.
Edit intent: fluency
Original:  Here, we present a simple, elegant yet unexplored measure, ' degree difference' (DD) between vertices of an edge, to quantify the local network geometry.
Revised:  Here, we analyze a simple, elegant yet unexplored measure, ' degree difference' (DD) between vertices of an edge, to quantify the local network geometry.
Edit intent: clarity
Original:  Here, we present a simple, elegant yet unexplored measure, ' degree difference' (DD) between vertices of an edge, to quantify the local network geometry.
Revised:  Here, we present a simple, elegant yet underexplored measure, ` degree difference' (DD) between vertices of an edge, to quantify the local network geometry.
Edit intent: clarity
Original:  Here, we present a simple, elegant yet unexplored measure, ' degree difference' (DD) between vertices of an edge, to quantify the local network geometry.
Revised:  Here, we present a simple, elegant yet unexplored measure, ' degree difference' (DD) between vertices of an edge, to understand the local network geometry.
Edit intent: clarity
Original:  Notably, DD is the atomic root of assortativity.
Revised:  Notably, DD is the basic unit of assortativity.
Edit intent: clarity
Original:  We provide an explanation  why DD can characterize structural heterogeneity in mixing patterns unlike global assortativity and local node assortativity.
Revised:  We provide an explanation as to why DD can characterize structural heterogeneity in mixing patterns unlike global assortativity and local node assortativity.
Edit intent: clarity
Original:  By analyzing model and real networks, we show that DD distribution can be used to distinguish between different types of networks including those networks that cannot be easily distinguished using degree sequence and global assortativity.
Revised:  By analyzing synthetic and real networks, we show that DD distribution can be used to distinguish between different types of networks including those networks that cannot be easily distinguished using degree sequence and global assortativity.
Edit intent: clarity
Original:  We detail how to treat unbalanced cases, where the surrogates to be combined have a different number of poles.
Edit intent: coherence
Original:  We explain how our proposed technique can be applied even in a high-dimensional setting , by employing locally-refined sparse grids  to weaken the curse of dimensionality.
Revised:  We explain how our method can be applied even in a high-dimensional setting , by employing locally-refined sparse grids to weaken the curse of dimensionality.
Edit intent: clarity
Original:  We explain how our proposed technique can be applied even in a high-dimensional setting , by employing locally-refined sparse grids  to weaken the curse of dimensionality.
Revised:  We explain how our proposed technique can be applied even in high-dimensional setting , by employing locally-refined sparse grids to weaken the curse of dimensionality.
Edit intent: fluency
Original:  We explain how our proposed technique can be applied even in a high-dimensional setting , by employing locally-refined sparse grids  to weaken the curse of dimensionality.
Revised:  We explain how our proposed technique can be applied even in a high-dimensional settings , by employing locally-refined sparse grids to weaken the curse of dimensionality.
Edit intent: fluency
Original:  Numerical examples are used to showcase the effectiveness of the method, and to highlight some of its limitations in dealing with unbalanced  matching, as well as with a large number of parameters.
Revised:  Numerical examples are used to showcase the effectiveness of the method, and to highlight some of its limitations in dealing with unbalanced pole matching, as well as with a large number of parameters.
Edit intent: fluency
Original: Custodian is a core financial service in which the custodian holds in safekeeping assets on behalf of the client.
Revised: Custody is a core financial service in which the custodian holds in safekeeping assets on behalf of the client.
Edit intent: fluency
Original: Custody is a core financial service in which the custodian holds in safekeeping assets on behalf of the client.
Revised: Asset custody is a core financial service in which the custodian holds in safekeeping assets on behalf of the client.
Edit intent: clarity
Original: Custody is a core financial service in which the custodian holds in safekeeping assets on behalf of the client.
Revised: Custody is a core financial service in which the custodian holds in-safekeeping assets on behalf of the client.
Edit intent: fluency
Original:  In this work, we propose a framework of decentralized asset custody scheme that is able to support a large number of custodians and safely hold customer assets of multiple times  value of the total security deposit.
Revised:  In this work, we propose a framework of decentralized asset custody scheme that is able to support a large number of custodians and safely hold customer assets of multiple times the value of the total security deposit.
Edit intent: fluency
Original:  The proposed custody scheme distributes custodians and assets into many custodian groups via combinatorial designs and random sampling , where each group fully controls the assigned assets.
Revised:  The proposed custody scheme distributes custodians and assets into many custodian groups via combinatorial designs , where each group fully controls the assigned assets.
Edit intent: clarity
Original:  The security of this custody scheme is guaranteed in the game-theoretic sense , such that any adversary corrupting a bounded fraction of custodians cannot move assets more than his own security deposit .
Revised:  The security of this custody scheme is guaranteed in the game-theoretic sense , such that any adversary corrupting a bounded fraction of custodians cannot move assets more than the security deposit paid .
Edit intent: clarity
Original:  Moreover, we prove matching upper bounds both in the finite-sum and online regimes, which establish that Page is an optimal method.
Revised:  Moreover, we prove matching upper bounds both in the finite-sum and online regimes, which establish that PAGE is an optimal method.
Edit intent: fluency
Original: In this paper, we propose a novel stochastic gradient estimator---ProbAbilistic Gradient Estimator (PAGE) ---for nonconvex optimization.
Revised: In this paper, we propose a novel stochastic gradient estimator -- ProbAbilistic Gradient Estimator (PAGE) ---for nonconvex optimization.
Edit intent: fluency
Original: In this paper, we propose a novel stochastic gradient estimator---ProbAbilistic Gradient Estimator (PAGE) ---for nonconvex optimization.
Revised: In this paper, we propose a novel stochastic gradient estimator---ProbAbilistic Gradient Estimator (PAGE) -- for nonconvex optimization.
Edit intent: fluency
Original:  PAGE is easy to implement as it is designed via a small adjustment to vanilla SGD: in each iteration, PAGE uses the vanilla minibatch SGD update with probability p  or reuses the previous gradient with a small adjustment, at a much lower computational cost, with probability 1-p  . We give a simple formula for the optimal choice of p . We prove tight lower bounds for nonconvex{\epsilon^2}) for nonconvex finite-sum } problems, which are of independent interest.
Revised:  PAGE is easy to implement as it is designed via a small adjustment to vanilla SGD: in each iteration, PAGE uses the vanilla minibatch SGD update with probability p or reuses the previous gradient with a small adjustment, at a much lower computational cost, with probability 1-p _t . We give a simple formula for the optimal choice of p . We prove tight lower bounds for nonconvex{\epsilon^2}) for nonconvex finite-sum } problems, which are of independent interest.
Edit intent: clarity
Original:  Then, we show that PAGE obtains the optimal convergence results O(n+\sqrt{n}{\epsilon^2}) (} finite-sum {\epsilon^2}) (online) matching our lower bounds for both nonconvex finite-sum } and online regimes, which establish that PAGE is an optimal method .
Revised:  Then, we show that PAGE obtains the optimal convergence results O(n+\sqrt{n}{\epsilon^2}) (} finite-sum {\epsilon^2}) (online) matching our lower bounds for both nonconvex finite-sum } and online problems .
Edit intent: clarity
Original:  Besides, we  show that for nonconvex functions satisfying the Polyak-ojasiewicz (PL) condition, PAGE can automatically switch to a faster linear convergence rate  .
Revised:  Besides, we also show that for nonconvex functions satisfying the Polyak-ojasiewicz (PL) condition, PAGE can automatically switch to a faster linear convergence rate .
Edit intent: coherence
Original:  Finally, we conduct several deep learning experiments (e.g., LeNet, VGG, ResNet) on real datasets in PyTorch , and the results demonstrate that PAGE not only converges much faster than SGD in training but also achieves the higher test accuracy, validating our theoretical results and confirming the practical superiority of PAGE.
Revised:  Finally, we conduct several deep learning experiments (e.g., LeNet, VGG, ResNet) on real datasets in PyTorch showing that PAGE not only converges much faster than SGD in training but also achieves the higher test accuracy, validating our theoretical results and confirming the practical superiority of PAGE.
Edit intent: coherence