wanyu/IteraTeR_v2 huggingface dataset:
Original:  To create the dataset, we devised a process for the collection of YouTube videos based on major  events from recent years crawled from Wikipedia and deployed a retrieval pipeline for the automatic selection of query videos based on their estimated suitability as benchmarks.
Revised:  To create the dataset, we devise a process for the collection of YouTube videos based on major events from recent years crawled from Wikipedia and deployed a retrieval pipeline for the automatic selection of query videos based on their estimated suitability as benchmarks.
Edit intent: fluency
Original:  To create the dataset, we devised a process for the collection of YouTube videos based on major  events from recent years crawled from Wikipedia and deployed a retrieval pipeline for the automatic selection of query videos based on their estimated suitability as benchmarks.
Revised:  To create the dataset, we devised a process for the collection of YouTube videos based on major news events from recent years crawled from Wikipedia and deployed a retrieval pipeline for the automatic selection of query videos based on their estimated suitability as benchmarks.
Edit intent: clarity
Original:  To create the dataset, we devised a process for the collection of YouTube videos based on major  events from recent years crawled from Wikipedia and deployed a retrieval pipeline for the automatic selection of query videos based on their estimated suitability as benchmarks.
Revised:  To create the dataset, we devised a process for the collection of YouTube videos based on major events from recent years crawled from Wikipedia and deploy a retrieval pipeline for the automatic selection of query videos based on their estimated suitability as benchmarks.
Edit intent: fluency
Original:  We also devised a protocol for the annotation of the dataset with respect to the four types of video association defined by FIVR.
Revised:  We also devise a protocol for the annotation of the dataset with respect to the four types of video association defined by FIVR.
Edit intent: fluency
Original:  We also devised a protocol for the annotation of the dataset with respect to the four types of video association defined by FIVR.
Revised:  We also devised a protocol for the annotation of the dataset with respect to the four types of video associations defined by FIVR.
Edit intent: fluency
Original:  Finally, we report  results of an experimental study on the dataset comparing  a variety of state-of-the-art visual descriptorsand aggregation techniques , highlighting the challenges of the problem at hand .
Revised:  Finally, we report the results of an experimental study on the dataset comparing a variety of state-of-the-art visual descriptorsand aggregation techniques , highlighting the challenges of the problem at hand .
Edit intent: fluency
Original:  Finally, we report  results of an experimental study on the dataset comparing  a variety of state-of-the-art visual descriptorsand aggregation techniques , highlighting the challenges of the problem at hand .
Revised:  Finally, we report results of an experimental study on the dataset comparing a variety of visual descriptors , highlighting the challenges of the problem at hand .
Edit intent: clarity
Original:  Finally, we report  results of an experimental study on the dataset comparing  a variety of state-of-the-art visual descriptorsand aggregation techniques , highlighting the challenges of the problem at hand .
Revised:  Finally, we report results of an experimental study on the dataset comparing a variety of state-of-the-art visual descriptorsand aggregation techniques , highlighting the challenges of the current problem .
Edit intent: clarity
Original:  By predicting future states and sharing this information with their neighbours , the agents are able to detect and avoid collisions while moving towards their goals.
Revised:  By predicting future states and sharing this information with their neighbors , the agents are able to detect and avoid collisions while moving towards their goals.
Edit intent: fluency
Original:  By predicting future states and sharing this information with their neighbours , the agents are able to detect and avoid collisions while moving towards their goals.
Revised:  By predicting future states and sharing this information with their neighbours , the agents are able to detect and avoid collisions while moving toward their goals.
Edit intent: fluency
Original:  It reduces the computation time by more than 85\% compared to previous optimization approaches based on sequential convex programming (SCP), with only causing a small impact on the optimality of the plans.
Revised:  It reduces the computation time by more than 85\% compared to previous optimization approaches based on sequential convex programming , while only having a small impact on the optimality of the plans.
Edit intent: clarity
Original:  We replaced the previous compatibility constraints in DMPC, which limit the motion of the agents in order to avoid collisions, by relaxing the collision constraints and enforcing them only when required.
Edit intent: coherence
Original:  The approach was validated both through extensive simulations for a wide range of randomly generated transitions and with teams of up to 25 quadrotors flying in confined indoor spaces.
Revised:  The approach was validated both through extensive simulations and experimentally with teams of up to 25 quadrotors flying in confined indoor spaces.
Edit intent: clarity
Original:  By combining them we develop a new fourth order accurate finite difference discretization for the wave equation with hanging nodes on the mesh refinement interface.
Revised:  By combining them we develop a new fourth order accurate finite difference discretization with hanging nodes on the mesh refinement interface.
Edit intent: clarity
Original:  An attractive feature of the proposed method is that the explicit time step does not need to be reduced relative to the corresponding periodic problem.
Revised:  Another attractive feature of the proposed method is that the explicit time step does not need to be reduced relative to the corresponding periodic problem.
Edit intent: fluency
Original:  A detailed comparison of the accuracy and the time-step restriction of the simultaneous-approximation-term penalty method is also presented.
Revised:  A detailed comparison of the accuracy and the time-step restriction with the simultaneous-approximation-term penalty method is also presented.
Edit intent: fluency
Original: Cheeger's inequality states that a tightly connected subset can be extracted from a graph G using an eigenvector of the normalized Laplacian associated with G. More specifically, we can compute a subset with conductance O( \sqrt{phi_G ), where \phi_G is the minimum conductance of a set in G. It has recently been shown that Cheeger's inequality can be extended to hypergraphs.
Revised: Cheeger's inequality states that a tightly connected subset can be extracted from a graph G using an eigenvector of the normalized Laplacian associated with G. More specifically, we can compute a subset with conductance O( \sqrt{\phi_G ), where \phi_G is the minimum conductance of a set in G. It has recently been shown that Cheeger's inequality can be extended to hypergraphs.
Edit intent: fluency
Original:  We show that the heat equation has a unique solution and that we can extract a subset with conductance \sqrt{phi_G from the solution.
Revised:  We show that the heat equation has a unique solution and that we can extract a subset with conductance \sqrt{\phi_G from the solution.
Edit intent: fluency
Original: In this paper, we investigate the optimal strong convergence rate of numerical approximations for the Cox--Ingersoll--Ross model driven by fractional Brownian motion with Hurst parameter H > 1/ 2. To deal with the  unbounded diffusion coefficient and ensure the positivity of the numerical solution, we apply the backward Euler scheme to an auxiliary equation based on Lamperti transformation.
Revised: In this paper, we investigate the optimal strong convergence rate of numerical approximations for the Cox--Ingersoll--Ross model driven by fractional Brownian motion with Hurst parameter H > 1/ 2. To deal with the difficulties caused by the unbounded diffusion coefficient and ensure the positivity of the numerical solution, we apply the backward Euler scheme to an auxiliary equation based on Lamperti transformation.
Edit intent: clarity
Original: In this paper, we investigate the optimal strong convergence rate of numerical approximations for the Cox--Ingersoll--Ross model driven by fractional Brownian motion with Hurst parameter H > 1/ 2. To deal with the  unbounded diffusion coefficient and ensure the positivity of the numerical solution, we apply the backward Euler scheme to an auxiliary equation based on Lamperti transformation.
Revised: In this paper, we investigate the optimal strong convergence rate of numerical approximations for the Cox--Ingersoll--Ross model driven by fractional Brownian motion with Hurst parameter H > 1/ 2. To deal with the unbounded diffusion coefficient , we study an auxiliary equation based on Lamperti transformation.
Edit intent: clarity
Original: We propose an effective method for creating interpretable control agents, byre-purposing the function of a biological neural circuit model, to govern simulated and real world reinforcement learning (RL) test-beds .
Revised: We propose re-purposing the function of a biological neural circuit model, to govern simulated and real world reinforcement learning (RL) test-beds .
Edit intent: clarity
Original: We propose an effective method for creating interpretable control agents, byre-purposing the function of a biological neural circuit model, to govern simulated and real world reinforcement learning (RL) test-beds .
Revised: We propose an effective method for creating interpretable control agents, byre-purposing the function of a biological neural circuit model, to govern simulated and real-world control tasks .
Edit intent: clarity
Original:  Inspired by the structure of the nervous system of the soil-worm, C. elegans , we introduce Neuronal Circuit Policies (NCPs) as a novel recurrent neural network instance with liquid time-constants, universal approximation capabilities and interpretable dynamics.
Revised:  Inspired by the structure of the nervous system of the soil-worm, C. elegans , we introduce Neuronal Circuit Policies (NCPs) as a novel recurrent neural network instance with liquid time-constants, universal approximation capabilities and interpretable dynamics.
Edit intent: fluency
Original:  We model instances of the policies and learn their synaptic and neuronal parameters to control standard RL tasksand demonstrate its application for autonomous parking of a real rover roboton a pre-defined trajectory .
Revised:  We model instances of the policies and learn their synaptic and neuronal parameters to control standard RL tasksand demonstrate its application for autonomous parking of a real-world rover robot .
Edit intent: clarity
Original:  For reconfiguration of the purpose of the neural circuit, we adopt a search-based RL algorithm.
Revised:  For reconfiguration of the purpose of the neural circuit, we adopt a search-based RL algorithm.
Edit intent: fluency
Original:  We show that our neuronal circuit policies perform as good as deep neural network policies with the advantage of realizing interpretable dynamics at the cell-level .
Revised:  We show that our neuronal circuit policies perform on par and in some cases surpass the performance of contemporary deep learning models with the advantage of realizing interpretable dynamics at the cell-level .
Edit intent: clarity
Original:  Radiotherapy is an important curative treatment for this disease, but it requires manually intensive delineation of radiosensitive organs at risk (OARs).
Revised:  Radiotherapy is an important curative treatment for this disease, but it requires manual time consuming delineation of radio-sensitive organs at risk (OARs).
Edit intent: clarity
Original:  This planning process can delay treatment commencement .
Revised:  This planning process can delay treatment , while also introducing inter-operator variability with resulting downstream radiation dose differences .
Edit intent: clarity
Original:  Adopting a deep learning approach, we demonstrate a 3D U-Net architecture that achieves performance similar to experts in delineating a wide range of head and neck OARs  . The model was trained on a dataset of 663 deidentified computed tomography (CT) scans acquired in routine clinical practice and segmented according to consensus OAR definitions.
Revised:  Adopting a deep learning approach, we demonstrate a 3D U-Net architecture that achieves performance similar to experts in delineating a wide range of head and neck OARs commonly segmented in clinical practice . The model was trained on a dataset of 663 deidentified computed tomography (CT) scans acquired in routine clinical practice and segmented according to consensus OAR definitions.
Edit intent: clarity
Original:  We demonstrate its generalisability through application to an independent test set of 24 CT scans available from The Cancer Imaging Archive collected at multiple international sites previously unseen to the model, each segmented by two independent experts and consisting of 21 OARs commonly segmented in clinical practice.
Revised:  We demonstrate the model's clinical applicability by assessing its performance on a test set of 24 CT scans available from The Cancer Imaging Archive collected at multiple international sites previously unseen to the model, each segmented by two independent experts and consisting of 21 OARs commonly segmented in clinical practice.
Edit intent: clarity
Original:  We demonstrate its generalisability through application to an independent test set of 24 CT scans available from The Cancer Imaging Archive collected at multiple international sites previously unseen to the model, each segmented by two independent experts and consisting of 21 OARs commonly segmented in clinical practice.
Revised:  We demonstrate its generalisability through application to an independent test set of 21 CT scans from clinical practice, each with the 21 OARs segmented by two independent experts and consisting of 21 OARs commonly segmented in clinical practice.
Edit intent: clarity
Original:  With appropriate validation studies and regulatory approvals, this system could improve the effectiveness of radiotherapy pathways.
Revised:  With appropriate validation studies and regulatory approvals, this system could improve the efficiency, consistency, and safety of radiotherapy pathways.
Edit intent: clarity
Original: Algorithmic predictions are increasingly used to aid, or in some cases supplant, human decision-making, and this development has placed new demands on the outputs of machine learning procedures.
Revised: Algorithms are increasingly used to aid, or in some cases supplant, human decision-making, and this development has placed new demands on the outputs of machine learning procedures.
Edit intent: clarity
Original:  To facilitate human interaction  , we desire that they output prediction functions that are in some fashion simple or interpretable .
Revised:  To facilitate human interaction , we desire prediction functions that are in some fashion simple or interpretable .
Edit intent: clarity
Original:  And because they influence consequential decisions, we also desire equitable prediction functions, ones whose allocationsbenefit (or at the least do not harm) disadvantaged groups .
Revised:  And because they influence consequential decisions, we also want them to produce equitable allocations .
Edit intent: clarity
Original:  We develop a formal model to explore the relationship between  simplicity and equity.
Revised:  We develop a formal model to explore the relationship between the demands of simplicity and equity.
Edit intent: clarity
Original:  Although the two concepts appear to be motivated by qualitatively distinct goals, our main result shows a fundamental inconsistency between them.
Revised:  Although the two concepts appear to be motivated by qualitatively distinct goals, we show a fundamental inconsistency between them.
Edit intent: clarity
Original:  Our result is not only about algorithms but about any process that produces simple models, and as such connects to the psychology of stereotypes and to an earlier economics literature on statistical discrimination.
Revised:  Our result is not only about algorithms but about any process that produces simple models, and as such they connect to the psychology of stereotypes and to an earlier economics literature on statistical discrimination.
Edit intent: clarity
Original: In this work, we propose two different sequential and adaptive hypothesis tests, motivated from classic Chernoff's test, for both decentralized and distributed setup of sensor networks .
Revised: We study "active" decision making over sensor networks where the sensors' sequential probing actions are actively chosen by continuously learning from past observations. We consider two network settings: with and without central coordination .
Edit intent: clarity
Original:  In the former setup, the sensors can communicate via central entityi.e. fusion center.
Revised:  In the first case, the network nodes interact with each other through a central entity, which plays the role of a fusion center.
Edit intent: clarity
Original:  This test is also asymptotic optimal in the higher moments of decision time .
Revised:  The test is also asymptotic optimal in the higher moments of decision time .
Edit intent: fluency
Original:  This test is also asymptotic optimal in the higher moments of decision time .
Revised:  This test is also asymptotically optimal in the higher moments of decision time .
Edit intent: fluency
Original:  The proposed test is parsimonious in terms of communications as the expected number of channel uses required by each sensor, in the regime of vanishing observation cost per unit time, to complete the test converges to four.
Revised:  The proposed test is parsimonious in terms of communications , and the expected number of channel uses required by each sensor, in the regime of vanishing observation cost per unit time, to complete the test converges to four.
Edit intent: coherence
Original:  This test is parsimonious is terms of communications in comparison to the state of art schemes proposed in the literature for distributed hypothesis testing .
Revised:  This test is parsimonious in terms of communications in comparison to the state of art schemes proposed in the literature for distributed hypothesis testing .
Edit intent: fluency
Original:  This test is parsimonious is terms of communications in comparison to the state of art schemes proposed in the literature for distributed hypothesis testing .
Revised:  This test is parsimonious is terms of communications in comparison to state-of-the-art schemes proposed in the literature for distributed hypothesis testing .
Edit intent: fluency
Original: In social media , recommender systems are responsible for directing the users to relevant content .
Revised: In online platforms , recommender systems are responsible for directing the users to relevant content .
Edit intent: clarity
Original: In social media , recommender systems are responsible for directing the users to relevant content .
Revised: In social media , recommender systems are responsible for directing users to relevant content .
Edit intent: fluency
Original: In social media , recommender systems are responsible for directing the users to relevant content .
Revised: In social media , recommender systems are responsible for directing the users to relevant contents .
Edit intent: fluency
Original:  In order to enhance the users' engagement, recommender systems adapt their output to the expected reactions of the users, which are in turn affected by the recommended contents.
Revised:  In order to enhance the users' engagement, recommender systems adapt their output to the reactions of the users, which are in turn affected by the recommended contents.
Edit intent: clarity
Original:  In order to enhance the users' engagement, recommender systems adapt their output to the expected reactions of the users, which are in turn affected by the recommended contents.
Revised:  In order to enhance the users' engagement, recommender systems adapt their output to the expected reactions of the users, who are in turn affected by the recommended contents.
Edit intent: fluency
Original:  In this work, we model a single user that interacts with an online news aggregator, with the purpose of making explicit the feedback loop between the evolution of the user's opinion and the personalised recommendation of contents.
Revised:  In this work, we study a tractable analytical model of a user that interacts with an online news aggregator, with the purpose of making explicit the feedback loop between the evolution of the user's opinion and the personalised recommendation of contents.
Edit intent: clarity
Original:  We assume that the user has a scalar opinion on a certain issue  : this opinion is influenced by all received news, which are characterized by a binary position on the issue at hand.
Revised:  We assume that the user is endowed with a scalar opinion on a certain issue : this opinion is influenced by all received news, which are characterized by a binary position on the issue at hand.
Edit intent: clarity
Original:  We assume that the user has a scalar opinion on a certain issue  : this opinion is influenced by all received news, which are characterized by a binary position on the issue at hand.
Revised:  We assume that the user has a scalar opinion about a certain issue : this opinion is influenced by all received news, which are characterized by a binary position on the issue at hand.
Edit intent: fluency
Original:  The user has a confirmation bias, that is, a preference for news that confirm her current opinion.
Revised:  The user is affected by a confirmation bias, that is, a preference for news that confirm her current opinion.
Edit intent: clarity
Original:  At the same time, we assume that the recommender has the goal of maximizing the number of user's clicks (as a measure of her engagement): in order to fulfil its goal, the recommender has to compromise between exploring the user's preferences and exploiting them .
Revised:  The news aggregator recommends items with the goal of maximizing the number of user's clicks (as a measure of her engagement): in order to fulfil its goal, the recommender has to compromise between exploring the user's preferences and exploiting them .
Edit intent: clarity
Original:  We find that personalised contents and confirmation bias do affect the evolution of opinions : the extent of these effects is inherently related to the effectiveness of the recommender.
Revised:  We find that personalised recommendations markedly affect the evolution of opinions : the extent of these effects is inherently related to the effectiveness of the recommender.
Edit intent: clarity
Original:  We also show that by tuning the amount of randomness in the recommendation algorithm, one can reduce the impact of the recommendation system  on the opinions.
Revised:  We also show that by tuning the amount of randomness in the recommendation algorithm, one can seek a balance between the effectiveness of the recommendation system on the opinions.
Edit intent: clarity
Original:  This implies that the search for universal targets for such families may be limited to simple cliques.
Revised:  This implies that the search for universal targets for such families may be restricted to simple cliques.
Edit intent: fluency
Original:  The state-of-the-art  for basic block reordering is to maximize the number of fall-through branches.
Revised:  The state-of-the-art goal for basic block reordering is to maximize the number of fall-through branches.
Edit intent: clarity