wanyu/IteraTeR_v2 huggingface dataset:
Original: The main focus of this article is to provide a mathematical study of the algorithm proposed in ~ boyaval2010variance where the authors proposed a variance reduction technique for the computation of parameter-dependent expectations using a reduced basis paradigm.
Revised: The main focus of this article is to provide a mathematical study of the algorithm proposed in boyaval2010variance where the authors proposed a variance reduction technique for the computation of parameter-dependent expectations using a reduced basis paradigm.
Edit intent: fluency
Original:  In particular, using concentration inequalities for the empirical measure in Wasserstein distance proved in ~ fournier2015rate, we provide sufficient conditions on the number of samples used for the computation of empirical variances at each iteration of the greedy procedure to guarantee that the resulting method algorithm is a weak greedy algorithm with high probability.
Revised:  In particular, using concentration inequalities for the empirical measure in Wasserstein distance proved in fournier2015rate, we provide sufficient conditions on the number of samples used for the computation of empirical variances at each iteration of the greedy procedure to guarantee that the resulting method algorithm is a weak greedy algorithm with high probability.
Edit intent: fluency
Original:  Our sliding-window implementation of radar odometry outperforms existing hand-crafted methods and approaches the current state of the art without requiring a groundtruth trajectory for training.
Revised:  Our sliding-window implementation of radar odometry outperforms most hand-crafted methods and approaches the current state of the art without requiring a groundtruth trajectory for training.
Edit intent: clarity
Original:  The proofs necessitate various contributions to the existing multivariate polynomial libraries in Isabelle/HOL , including a method for re-indexing variables in a polynomial .
Revised:  The proofs necessitate various contributions to the existing multivariate polynomial libraries in Isabelle/HOL .
Edit intent: clarity
Original:  Our framework is modularized and easily expandable (to facilitate integrating future optimizations), and could serve as a basis for developing a general-purpose QE algorithm .
Revised:  Our framework is modularized and easily expandable (to facilitate integrating future optimizations), and could serve as a basis for developing practical general-purpose QE algorithm .
Edit intent: clarity
Original:  Our framework is modularized and easily expandable (to facilitate integrating future optimizations), and could serve as a basis for developing a general-purpose QE algorithm .
Revised:  Our framework is modularized and easily expandable (to facilitate integrating future optimizations), and could serve as a basis for developing a general-purpose QE algorithms .
Edit intent: fluency
Original: Advertisers play an important role in e-commerce platforms, whose advertising expenditures are the main source of revenue for e-commerce platforms.
Revised: Advertising expenditures have become the major source of revenue for e-commerce platforms.
Edit intent: clarity
Original:  Therefore, providing advertisers with a better advertising experience by reducing their cost of trial and error during ad real-time bidding is crucial to the long-term revenue of e-commerce platforms .
Revised:  Providing good advertising experiences for advertisers through reducing their costs of trial and error during ad real-time bidding is crucial to the long-term revenue of e-commerce platforms .
Edit intent: clarity
Original:  Therefore, providing advertisers with a better advertising experience by reducing their cost of trial and error during ad real-time bidding is crucial to the long-term revenue of e-commerce platforms .
Revised:  Therefore, providing advertisers with a better advertising experience by reducing their cost of trial and error for discovering the optimal advertising strategies is crucial for the long-term revenue of e-commerce platforms .
Edit intent: clarity
Original:  Therefore, providing advertisers with a better advertising experience by reducing their cost of trial and error during ad real-time bidding is crucial to the long-term revenue of e-commerce platforms .
Revised:  Therefore, providing advertisers with a better advertising experience by reducing their cost of trial and error during ad real-time bidding is crucial to the long-term prosperity of online advertising .
Edit intent: clarity
Original:  To achieve this goal, the advertising platform needs to understand the advertisers' unique marketing demands and actively recommend personalized and optimal advertising strategies for them .
Revised:  To achieve this goal, the advertising platform needs to identify the advertisers' unique marketing demands and actively recommend personalized and optimal advertising strategies for them .
Edit intent: clarity
Original:  To achieve this goal, the advertising platform needs to understand the advertisers' unique marketing demands and actively recommend personalized and optimal advertising strategies for them .
Revised:  To achieve this goal, the advertising platform needs to understand the advertisers' marketing objectives, and then recommend the corresponding strategies to fulfill this objective .
Edit intent: clarity
Original:  We use a neural network as the agent to predict the  advertisers' demands based on their profile and historical adoption behaviors.
Revised:  We use the advertisers' demands based on their profile and historical adoption behaviors.
Edit intent: clarity
Original:  Providing good advertising experiences for advertisers through reducing their costs of trial and error for discovering the optimal advertising strategies is crucial for the long-term prosperity of online advertising.
Revised:  Providing good advertising experiences for advertisers by reducing their costs of trial and error for discovering the optimal advertising strategies is crucial for the long-term prosperity of online advertising.
Edit intent: clarity
Original:  Providing good advertising experiences for advertisers through reducing their costs of trial and error for discovering the optimal advertising strategies is crucial for the long-term prosperity of online advertising.
Revised:  Providing good advertising experiences for advertisers through reducing their costs of trial and error in discovering the optimal advertising strategies is crucial for the long-term prosperity of online advertising.
Edit intent: clarity
Original:  To achieve this goal, the advertising platform needs to identify the advertisers'marketing objectives, and then recommend the corresponding strategies to fulfill this objective .
Revised:  To achieve this goal, the advertising platform needs to identify the advertisers'marketing objectives, and then recommend the corresponding strategies to fulfill the objectives .
Edit intent: fluency
Original:  We further augment this prototype system by directly revealing the advertising performance, and then infer the advertisers' marketing objectives through their adoptions of different recommending advertising performance .
Revised:  We further augment this prototype system by explicitly learning the advertisers' preferences over various advertising performance indicators and then optimization objectives through their adoptions of different recommending advertising performance .
Edit intent: clarity
Original:  We further augment this prototype system by directly revealing the advertising performance, and then infer the advertisers' marketing objectives through their adoptions of different recommending advertising performance .
Revised:  We further augment this prototype system by directly revealing the advertising performance, and then infer the advertisers' marketing objectives through their adoptions of different recommending advertising strategies .
Edit intent: clarity
Original:  We use the techniques from context bandit to jointly learn the advertisers' marketing objectives and the recommending strategies.
Revised:  We use contextual bandit algorithms to efficiently learn the advertisers' marketing objectives and the recommending strategies.
Edit intent: clarity
Original:  Simulation experiments based on Taobao online bidding data show that the designed contextual bandit algorithm can effectively optimize the strategy adoption rate of advertisers.
Revised:  Simulation experiments based on Taobao online bidding data show that the designed algorithms can effectively optimize the strategy adoption rate of advertisers.
Edit intent: clarity
Original:  However, it is challenging to run firmware images of embedded devices in QEMU, especially theprocess to boot the Linux kernel (we call this process rehosting the Linux kernel in this paper .) That's because embedded devices usually use different system-on-chips (SoCs) from multiple vendors andonly a limited number of SoCs are currently supported in QEMU.
Revised:  However, it is challenging to run firmware images of embedded devices in QEMU, especially the process to boot the Linux kernel (we call this process rehosting the Linux kernel in this paper .) That's because embedded devices usually use different system-on-chips (SoCs) from multiple vendors andonly a limited number of SoCs are currently supported in QEMU.
Edit intent: fluency
Original:  However, it is challenging to run firmware images of embedded devices in QEMU, especially theprocess to boot the Linux kernel (we call this process rehosting the Linux kernel in this paper .) That's because embedded devices usually use different system-on-chips (SoCs) from multiple vendors andonly a limited number of SoCs are currently supported in QEMU.
Revised:  However, it is challenging to run firmware images of embedded devices in QEMU, especially theprocess to boot the Linux kernel (we call this process rehosting the Linux kernel .) That's because embedded devices usually use different system-on-chips (SoCs) from multiple vendors andonly a limited number of SoCs are currently supported in QEMU.
Edit intent: clarity
Original:  However, it is challenging to run firmware images of embedded devices in QEMU, especially theprocess to boot the Linux kernel (we call this process rehosting the Linux kernel in this paper .) That's because embedded devices usually use different system-on-chips (SoCs) from multiple vendors andonly a limited number of SoCs are currently supported in QEMU.
Revised:  However, it is challenging to run firmware images of embedded devices in QEMU, especially theprocess to boot the Linux kernel (we call this process rehosting the Linux kernel in this paper .) That's because embedded devices usually use different system-on-chips (SoCs) from multiple vendors and only a limited number of SoCs are currently supported in QEMU.
Edit intent: fluency
Original:  In this work, we propose a technique calledperipheral transplantation.
Revised:  In this work, we propose a technique called peripheral transplantation.
Edit intent: fluency
Original:  The main idea is to transplant the device drivers of designated peripherals into the Linux kernel binary .
Revised:  The main idea is to transplant the device drivers of designated peripherals into the Linux kernel .
Edit intent: clarity
Original:  The resultshows that ECMO can successfully transplant peripherals for all the 824 Linux kernels.
Revised:  The result shows that ECMO can successfully transplant peripherals for all the 824 Linux kernels.
Edit intent: fluency
Original:  We further build three applications, i.e., kernel crash analysis, rootkit forensic analysis, and kernel fuzzing, based on the rehosted kernels to demonstrate the usage scenarios of ECMO .
Revised:  We further build three applications, i.e., kernel crash analysis, rootkit forensic analysis, and kernel fuzzing, based on the rehosted kernels to demonstrate the usage scenarios of ECMO 
Edit intent: fluency
Original: The availability of large datasets composed of graphs creates an unprecedented need to invent novel tools in statistical learning for "graph-valued random variables".
Edit intent: coherence
Original:  To characterize the "average" of a sample of graphs, one can compute the sample Fr\'echet mean . Because the sample mean should provide an interpretable summary of the graph sample , one would expect that the structural properties of the sample be transmitted to the Fr\'echet mean .
Revised:  To characterize the "average" of a sample of graphs, one can compute the sample Fr\'echet mean . Because the sample mean should provide an interpretable summary of the graph sample .
Edit intent: coherence
Original:  In fact , we prove a stronger result: the edge density of the sample Fr\'echet mean is bounded by the edge density of the graphs in the sample.
Revised:  In fact , we prove that the edge density of the sample Fr\'echet mean is bounded by the edge density of the graphs in the sample.
Edit intent: clarity
Original:  We validated our algorithm on a large collection of simulated 3D manipulation tasks .
Revised:  We validated our algorithm on many simulated 3D manipulation tasks .
Edit intent: clarity
Original:  Moreover, we prove that the variant of our modal language with finite propositional atoms interpreted over these models is NP-complete.
Revised:  Moreover, we prove that satisfiability checking for our modal language with finite propositional atoms interpreted over these models is NP-complete.
Edit intent: clarity
Original:  Moreover, we prove that the variant of our modal language with finite propositional atoms interpreted over these models is NP-complete.
Revised:  Moreover, we prove that the variant of our modal language relative to such a class of models is NP-complete.
Edit intent: clarity
Original:  We leverage the language to formalize counterfactual conditional as well as a bunch of notions of explanation such as abductive, contrastive and counterfactual explanations, and biases.
Revised:  We leverage the language to formalize counterfactual conditional as well as a variety of notions of explanation such as abductive, contrastive and counterfactual explanations, and biases.
Edit intent: clarity
Original:  We leverage the language to formalize counterfactual conditional as well as a bunch of notions of explanation such as abductive, contrastive and counterfactual explanations, and biases.
Revised:  We leverage the language to formalize counterfactual conditional as well as a bunch of notions of explanation including abductive, contrastive and counterfactual explanations, and biases.
Edit intent: clarity
Original:  In the proposed formulation, the computational domain is decomposed into two overlapping domains: the SIE and PDE domains.
Revised:  In the proposed formulation, the computational domain is decomposed into two overlapping domains: the SIE and PDE domains.
Edit intent: fluency
Original:  An equivalent model for those structures is constructed through replacing them by the background medium and introducing a surface equivalent electric current density on an enclosed boundary to represent their electromagnetic effects.
Revised:  An equivalent model for those structures is constructed by replacing them with the background medium and introducing a surface equivalent electric current density on an enclosed boundary to represent their electromagnetic effects.
Edit intent: fluency
Original:  Unlike other hybrid formulations, where the transmission condition is usually used, no boundary conditions are required in the proposed SIE-PDE formulation, and it is mathematically equivalent to the original physical model.
Revised:  It requires no boundary conditions are required in the proposed SIE-PDE formulation, and it is mathematically equivalent to the original physical model.
Edit intent: coherence
Original:  Unlike other hybrid formulations, where the transmission condition is usually used, no boundary conditions are required in the proposed SIE-PDE formulation, and it is mathematically equivalent to the original physical model.
Revised:  Unlike other hybrid formulations, where the transmission condition is usually used, no boundary conditions , and is mathematically equivalent to the original physical model.
Edit intent: coherence
Original:  Through careful construction of basis functions to expand electric fields and the equivalent current density, the discretized formulation is compatible on the interface of the SIE and PDE domain .
Revised:  Through careful construction of basis functions to expand electric fields and the equivalent current density, the discretized formulation is made compatible with the SIE and PDE domain .
Edit intent: clarity
Original:  Results show that the proposed SIE-PDE formulation can obtain accurate results including both near and far fields , and significant performance improvements in terms of CPU time and memory consumption compared with the FEM are achieved.
Revised:  Results show that the proposed SIE-PDE formulation can obtain accurate results , and significant performance improvements in terms of CPU time and memory consumption compared with the FEM are achieved.
Edit intent: clarity
Original:  how to learn better quality-aware features , and how to solve the problem of insufficient training samples  . Considering that perceptual visual quality is affected by both low-level visual features  and high-level semantic information  , we first propose a staircase structure to hierarchically integrate the features from intermediate layers into the final feature representation, which enables the model to make full use of visual information from low-level to high-level.
Revised:  how to learn better quality-aware feature representation , and how to solve the problem of insufficient training samples . Considering that perceptual visual quality is affected by both low-level visual features and high-level semantic information , we first propose a staircase structure to hierarchically integrate the features from intermediate layers into the final feature representation, which enables the model to make full use of visual information from low-level to high-level.
Edit intent: coherence
Original: Dynamic Network Embedding (DNE) has recently attracted considerable attention due to the advantage of network embedding in various applications and the dynamic nature of many real-world networks.
Revised: Dynamic Network Embedding (DNE) has recently attracted considerable attention due to the advantage of network embedding in various fields and the dynamic nature of many real-world networks.
Edit intent: clarity
Original:  For dynamic networks, the degree of changes , i.e., defined as the averaged number of changed edges between consecutive snapshotsspanning a dynamic network, could be very different in real-world scenarios.
Revised:  An input dynamic network to DNE is often assumed to have smooth changes over snapshots, which however would not hold for all real-world scenarios.
Edit intent: clarity
Original:  Specifically, the proposed method follows the notion of ensembles where the base learner adopts an incremental Skip-Gram neural embedding approach .
Revised:  Specifically, the proposed method follows the notion of ensembles where each base learner adopts an incremental Skip-Gram neural embedding approach .
Edit intent: clarity
Original:  Specifically, the proposed method follows the notion of ensembles where the base learner adopts an incremental Skip-Gram neural embedding approach .
Revised:  Specifically, the proposed method follows the notion of ensembles where the base learner adopts an incremental Skip-Gram embedding model .
Edit intent: clarity
Original:  To further boost the performance, a novel strategy is proposed to enhance the diversity among base learners at each timestep by capturing different levels of local-global topology.
Revised:  To further boost the performance, a simple yet effective strategy is designed to enhance the diversity among base learners at each timestep by capturing different levels of local-global topology.
Edit intent: clarity
Original:  Extensive experiments demonstrate the benefits of special designs in the proposed method, and the superior performance of the proposed method compared to state-of-the-art methods.
Revised:  Extensive experiments demonstrate the superior effectiveness and robustness of the proposed method compared to state-of-the-art methods.
Edit intent: clarity
Original:  In particular, it turns out that for this class of abstract program semantics, any nontrivial abstract property is undecidable and every decidable overapproximation necessarily includes an infinite set of false positives which covers all  values of the semantic abstract domain.
Revised:  In particular, it turns out that for this class of abstract program semantics, any nontrivial abstract property is undecidable and every decidable over-approximation necessarily includes an infinite set of false positives which covers all values of the semantic abstract domain.
Edit intent: fluency
Original:  In particular, it turns out that for this class of abstract program semantics, any nontrivial abstract property is undecidable and every decidable overapproximation necessarily includes an infinite set of false positives which covers all  values of the semantic abstract domain.
Revised:  In particular, it turns out that for this class of abstract program semantics, any nontrivial abstract property is undecidable and every decidable overapproximation necessarily includes an infinite set of false positives which covers all the values of the semantic abstract domain.
Edit intent: fluency
Original: Certified safe control is a growing challenge in robotics, especially when performance and safety objectives are desired to be concurrently achieved.
Revised: Certified safe control is a growing challenge in robotics, especially when performance and safety objectives must be concurrently achieved.
Edit intent: clarity
Original:  In this work, we extend the barrier state (BaS) concept, recently proposed for  stabilization of continuous time systems, to enforce safety for discrete time systems by creating a discrete barrier state (DBaS).
Revised:  In this work, we extend the barrier state (BaS) concept, recently proposed for stabilization of continuous time systems, to enforce safety for discrete time systems using discrete barrier states (DBaS).
Edit intent: clarity
Original:  The constructed DBaS is embedded into the discrete model of the safety-critical system in order to integrate safety objectives into  performance objectives.
Revised:  The constructed DBaS is embedded into the discrete model of the safety-critical system integrating safety objectives into performance objectives.
Edit intent: coherence
Original:  Furthermore, we employ the DBaS method to develop a safety embedded differential dynamic programming (DDP) technique to plan and execute safe optimal trajectories.
Revised:  Furthermore, we employ the DBaS with differential dynamic programming (DDP) technique to plan and execute safe optimal trajectories.
Edit intent: clarity
Original:  Furthermore, we employ the DBaS method to develop a safety embedded differential dynamic programming (DDP) technique to plan and execute safe optimal trajectories.
Revised:  Furthermore, we employ the DBaS method to develop a safety embedded differential dynamic programming (DDP) to plan and execute safe optimal trajectories.
Edit intent: clarity
Original:  The proposed algorithm is leveraged on  a differential wheeled robot  and on a quadrotor to safely perform several tasks including reaching , tracking and safe multi-quadrotor movement .
Revised:  The proposed algorithm is leveraged on a differential wheeled robot and on a quadrotor to safely perform reaching and tracking tasks .
Edit intent: clarity
Original:  The DBaS-based DDP (DBaS-DDP) is compared to the penalty method used in constrained DDP problems where it is shown that the DBaS-DDP consistently outperforms the penalty method .
Revised:  The DBaS-based DDP (DBaS-DDP) is shown to consistently outperform penalty methods commonly used in constrained DDP problems where it is shown that the DBaS-DDP consistently outperforms the penalty method .
Edit intent: clarity