wanyu/IteraTeR_v2 huggingface dataset:
Original:  Current state-of-the-art value-based MARL methods leverage CTDE to learn a centralized joint-action value function as a monotonic mixing of each agent's utility function, which enables easy decentralization .
Revised:  Current state-of-the-art value-based MARL methods leverage CTDE to learn a centralized action value function as a monotonic mixing of each agent's utility function, which enables easy decentralization .
Edit intent: clarity
Original:  Current state-of-the-art value-based MARL methods leverage CTDE to learn a centralized joint-action value function as a monotonic mixing of each agent's utility function, which enables easy decentralization .
Revised:  Current state-of-the-art value-based MARL methods leverage CTDE to learn a centralized joint-action value function as a monotonic mixing of per-agent utilities. While this enables easy decentralization .
Edit intent: coherence
Original:  UneVEn uses novel action-selection schemes between randomly sampled related tasksduring exploration, which enables the monotonic joint-action value function of the target task to place more importance on useful joint actions . Empirical results on a  challenging cooperative predator-prey task requiring significant coordination amongst agents show that UneVEn significantly outperforms state-of-the-art baselines .
Revised:  UneVEn uses novel action-selection schemes between randomly sampled related tasksduring exploration, which enables the monotonic joint-action value function of the target task to place more importance on useful joint actions . Empirical results on a set of exploration games, challenging cooperative predator-prey task requiring significant coordination amongst agents show that UneVEn significantly outperforms state-of-the-art baselines .
Edit intent: clarity
Original:  UneVEn uses novel action-selection schemes between randomly sampled related tasksduring exploration, which enables the monotonic joint-action value function of the target task to place more importance on useful joint actions . Empirical results on a  challenging cooperative predator-prey task requiring significant coordination amongst agents show that UneVEn significantly outperforms state-of-the-art baselines .
Revised:  UneVEn uses novel action-selection schemes between randomly sampled related tasksduring exploration, which enables the monotonic joint-action value function of the target task to place more importance on useful joint actions . Empirical results on a challenging cooperative predator-prey tasks requiring significant coordination amongst agents show that UneVEn significantly outperforms state-of-the-art baselines .
Edit intent: fluency
Original:  UneVEn uses novel action-selection schemes between randomly sampled related tasksduring exploration, which enables the monotonic joint-action value function of the target task to place more importance on useful joint actions . Empirical results on a  challenging cooperative predator-prey task requiring significant coordination amongst agents show that UneVEn significantly outperforms state-of-the-art baselines .
Revised:  UneVEn uses novel action-selection schemes between randomly sampled related tasksduring exploration, which enables the monotonic joint-action value function of the target task to place more importance on useful joint actions . Empirical results on a challenging cooperative predator-prey task requiring significant coordination amongst agents show that UneVEn can solve tasks where other state-of-the-art baselines .
Edit intent: clarity
Original:  Combining recent advances in image recognition technology with geocoding and crowdsourcing techniques to build a pipeline for image-based social sensing .
Revised:  Combining recent advances in image recognition technology with geocoding and crowdsourcing techniques .
Edit intent: clarity
Original:  We compared the results with the indicators produced within the Covid-19 behavior tracker initiative by ICL and YouGov (CovidDataHub) . Preliminary results shows that social media images can produce reliable indicators for policy makers.
Revised:  We compared the results with the indicators produced within the Covid-19 behavior tracker initiative . Preliminary results shows that social media images can produce reliable indicators for policy makers.
Edit intent: clarity
Original:  We further develop a reduction framework, inspired by proximal point methods in convex optimization, which bootstraps samplers for regularized densities to improve dependences on problem conditioning.
Revised:  We further develop a reduction framework, inspired by proximal point methods in convex optimization, which bootstraps samplers for regularized densities to improve dependences on problem conditioning.
Edit intent: fluency
Original: Despite the excellent performance of neural-network-based audio source separation methods and a wide range of applications, their robustness against intentional attacks has been largely neglected.
Revised: Despite the excellent performance of neural-network-based audio source separation methods and their wide range of applications, their robustness against intentional attacks has been largely neglected.
Edit intent: fluency
Original:  In this work we reformulate a variety of adversarial-attack methods for the audio source separation problem and intensively investigate them under different attack conditions and target models.
Revised:  In this work , we reformulate various adversarial attack methods for the audio source separation problem and intensively investigate them under different attack conditions and target models.
Edit intent: clarity
Original:  We further propose a simple yet effective regularization method to obtain imperceptible adversarial noise while maximizing the impact on separation quality with a low computational complexity.
Revised:  We further propose a simple yet effective regularization method to obtain imperceptible adversarial noise while maximizing the impact on separation quality with low computational complexity.
Edit intent: fluency
Original:  We study the expressiveness of TeamLTL ( and its extensions with downward closed generalised atoms A and connectives such as Boolean disjunction v) in comparison to HyperLTL and HyperQPTL.
Revised:  We study the expressivity of TeamLTL and its extensions with downward closed generalised atoms A and connectives such as Boolean disjunction v) in comparison to HyperLTL and HyperQPTL.
Edit intent: fluency
Original:  We study the expressiveness of TeamLTL ( and its extensions with downward closed generalised atoms A and connectives such as Boolean disjunction v) in comparison to HyperLTL and HyperQPTL.
Revised:  We study the expressiveness of TeamLTL ( and its extensions in comparison to HyperLTL and HyperQPTL.
Edit intent: coherence
Original:  Thereby, we also obtain a number of model checking results for TeamLTL , a question which is so far an open problem .
Revised:  By doing so we obtain a number of model checking results for TeamLTL , a question which is so far an open problem .
Edit intent: clarity
Original:  The two types of logics follow a fundamentally different approach to hyperproperties and are are of incomparable expressiveness .
Revised:  The two types of logics follow a fundamentally different approach to hyperproperties and are of incomparable expressivity .
Edit intent: fluency
Original:  We show decidability of model checking of the so-called " left-flat " fragment of TeamLTL (A,v) via a translation to a decidable fragment of HyperQPTL.
Revised:  We show decidability of model checking of the so-called left-flat " fragment of TeamLTL (A,v) via a translation to a decidable fragment of HyperQPTL.
Edit intent: fluency
Original:  We show decidability of model checking of the so-called " left-flat " fragment of TeamLTL (A,v) via a translation to a decidable fragment of HyperQPTL.
Revised:  We show decidability of model checking of the so-called " left-flat fragment of TeamLTL (A,v) via a translation to a decidable fragment of HyperQPTL.
Edit intent: fluency
Original:  Finally, we show that the model checking problem of TeamLTL with Boolean disjunction and inclusion atom is undecidable.
Revised:  Finally, we show that the model checking problem of TeamLTL with Boolean disjunction and inclusion atoms is undecidable.
Edit intent: fluency
Original: We study the expressivity and the model checking problem of linear temporal logic with team semantics (TeamLTL).
Revised: We study the expressivity and complexity of model checking linear temporal logic with team semantics (TeamLTL).
Edit intent: clarity
Original:  We study the expressivity of TeamLTL and its extensions in comparison to HyperLTL and HyperQPTL  . By doing so  we obtain a number of model checking results for TeamLTL and identify its undecidability frontier.
Revised:  We study the expressivity of TeamLTL and its extensions in comparison to HyperLTL and HyperQPTL ) . By doing so we obtain a number of model checking results for TeamLTL and identify its undecidability frontier.
Edit intent: fluency
Original:  We study the expressivity of TeamLTL and its extensions in comparison to HyperLTL and HyperQPTL  . By doing so  we obtain a number of model checking results for TeamLTL and identify its undecidability frontier.
Revised:  We study the expressivity of TeamLTL and its extensions in comparison to HyperLTL and HyperQPTL . By doing so , we obtain a number of model checking results for TeamLTL and identify its undecidability frontier.
Edit intent: fluency
Original: Isolation of symptomatic individuals, together with tracing and testing of their nonsymptomatic contacts , is a fundamental strategy for mitigating the current COVID-19 pandemic before pharmaceutical interventions become available .
Revised: Isolation of symptomatic individuals, tracing and testing of their nonsymptomatic contacts , is a fundamental strategy for mitigating the current COVID-19 pandemic before pharmaceutical interventions become available .
Edit intent: coherence
Original: Isolation of symptomatic individuals, together with tracing and testing of their nonsymptomatic contacts , is a fundamental strategy for mitigating the current COVID-19 pandemic before pharmaceutical interventions become available .
Revised: Isolation of symptomatic individuals, together with tracing and testing of their nonsymptomatic contacts are fundamental strategies for mitigating the current COVID-19 pandemic before pharmaceutical interventions become available .
Edit intent: fluency
Original: Isolation of symptomatic individuals, together with tracing and testing of their nonsymptomatic contacts , is a fundamental strategy for mitigating the current COVID-19 pandemic before pharmaceutical interventions become available .
Revised: Isolation of symptomatic individuals, together with tracing and testing of their nonsymptomatic contacts , is a fundamental strategy for mitigating the current COVID-19 pandemic .
Edit intent: coherence
Original:  The breaking of contagion chains relies on two main alternative strategies: manual reconstruction of contacts based on interviews or a digital (app-based) privacy-preserving contact tracing protocol .
Revised:  The breaking of contagion chains relies on two complementary strategies: manual reconstruction of contacts based on interviews or a digital (app-based) privacy-preserving contact tracing protocol .
Edit intent: clarity
Original:  The breaking of contagion chains relies on two main alternative strategies: manual reconstruction of contacts based on interviews or a digital (app-based) privacy-preserving contact tracing protocol .
Revised:  The breaking of contagion chains relies on two main alternative strategies: manual reconstruction of contacts based on interviews and a digital (app-based) privacy-preserving contact tracing protocol .
Edit intent: fluency
Original:  The breaking of contagion chains relies on two main alternative strategies: manual reconstruction of contacts based on interviews or a digital (app-based) privacy-preserving contact tracing protocol .
Revised:  The breaking of contagion chains relies on two main alternative strategies: manual reconstruction of contacts based on interviews or a digital (app-based) privacy-preserving contact tracing .
Edit intent: clarity
Original:  Our results indicate a careful integration of the two intrinsically different protocolsas key to optimal mitigation strategies .
Revised:  We show that this intrinsic difference makes the manual procedure dominant in realistic hybrid protocols .
Edit intent: coherence
Original:  Almost-sure termination (AST) is concerned with the question whether a program terminates with probability one on all possible inputs.
Revised:  Almost sure termination (AST) is concerned with the question whether a program terminates with probability one on all possible inputs.
Edit intent: clarity
Original:  Positive almost-sure termination (PAST) focuses on termination in a finite expected number of steps.
Revised:  Positive almost sure termination (PAST) focuses on termination in a finite expected number of steps.
Edit intent: fluency
Original: We present the Sum-Product Probabilistic Language (SPPL), a new system that automatically delivers exact solutions to a broad range of probabilistic inference queries.
Revised: We present the Sum-Product Probabilistic Language (SPPL), a new probabilistic programming language that automatically delivers exact solutions to a broad range of probabilistic inference queries.
Edit intent: clarity
Original:  SPPL symbolically represents the full distribution on execution traces specified by a probabilistic program using a generalization of sum-product  networks .
Revised:  SPPL translates probabilistic programs into sum-product networks .
Edit intent: clarity
Original:  We formalize SPPL in terms of a novel translation strategy from probabilistic programs to a semantic domain of sum-product representations, present new algorithms for exactly conditioning on and computing probabilities of queries, and prove their soundness under the semantics.
Revised:  We formalize SPPL via a novel translation strategy from probabilistic programs to a semantic domain of sum-product representations, present new algorithms for exactly conditioning on and computing probabilities of queries, and prove their soundness under the semantics.
Edit intent: clarity
Original:  We formalize SPPL in terms of a novel translation strategy from probabilistic programs to a semantic domain of sum-product representations, present new algorithms for exactly conditioning on and computing probabilities of queries, and prove their soundness under the semantics.
Revised:  We formalize SPPL in terms of a novel translation strategy from probabilistic programs to sum-product representations, present new algorithms for exactly conditioning on and computing probabilities of queries, and prove their soundness under the semantics.
Edit intent: clarity
Original:  We formalize SPPL in terms of a novel translation strategy from probabilistic programs to a semantic domain of sum-product representations, present new algorithms for exactly conditioning on and computing probabilities of queries, and prove their soundness under the semantics.
Revised:  We formalize SPPL in terms of a novel translation strategy from probabilistic programs to a semantic domain of sum-product expressions and give sound exact algorithms for conditioning on and computing probabilities of queries, and prove their soundness under the semantics.
Edit intent: clarity
Original:  We present techniques for improving the scalability of translation and inference by automatically exploiting conditional independences and repeated structurein SPPL programs .
Revised:  We present techniques for improving the scalability of translation and inference by automatically exploiting probabilistic structure .
Edit intent: clarity
Original:  We implement a prototype of SPPL with a modular architecture and evaluate it on a suite of common benchmarks , which establish that our system is up to 3500x faster than state-of-the-art systems for fairness verification;
Revised:  We implement a prototype of SPPL with a modular architecture and evaluate it on benchmarks the system targets, showing that it obtains up to 3500x faster than state-of-the-art systems for fairness verification;
Edit intent: clarity
Original:  We implement a prototype of SPPL with a modular architecture and evaluate it on a suite of common benchmarks , which establish that our system is up to 3500x faster than state-of-the-art systems for fairness verification;
Revised:  We implement a prototype of SPPL with a modular architecture and evaluate it on a suite of common benchmarks , which establish that our system is up to 3500x speedups over state-of-the-art systems for fairness verification;
Edit intent: clarity
Original:  We show that sorting in this scenario can be performed in polynomial time.
Revised:  We show that , for the sorting problem, such a decision tree can be found in polynomial time.
Edit intent: clarity
Original:  The ACM SIGSOFT Paper and Peer Review Quality Initiative generated empirical standards for common research methods in software engineering.
Revised:  The ACM SIGSOFT Paper and Peer Review Quality Initiative generated empirical standards for research methods commonly used in software engineering.
Edit intent: fluency
Original:  These living documents, which should be continuously revised to reflect evolving consensus around research best practices, can be used to make peer review more transparent, structured, harmonious and fair.
Revised:  These living documents, which should be continuously revised to reflect evolving consensus around research best practices, will improve research quality and make peer review more transparent, structured, harmonious and fair.
Edit intent: clarity
Original:  These living documents, which should be continuously revised to reflect evolving consensus around research best practices, can be used to make peer review more transparent, structured, harmonious and fair.
Revised:  These living documents, which should be continuously revised to reflect evolving consensus around research best practices, can be used to make peer review more effective, reliable, transparent and fair.
Edit intent: clarity
Original:  In particular, a simple treatment of method extraction would require methods to be contravariant in the reciever type, making overriding all-but-impossible.
Revised:  In particular, a simple treatment of method extraction would require methods to be contravariant in the receiver type, making overriding all-but-impossible.
Edit intent: fluency
Original:  Working in the context of Racket, whosestructure system includes a low-level form of methods, we show how to combine two existing type system features---existential types and occurrence typing--to produce a sound approach to typing method extraction.
Revised:  structure system includes a low-level form of methods, we show how to combine two existing type system features---existential types and occurrence typing--to produce a sound approach to typing method extraction.
Edit intent: coherence
Original:  Working in the context of Racket, whosestructure system includes a low-level form of methods, we show how to combine two existing type system features---existential types and occurrence typing--to produce a sound approach to typing method extraction.
Revised:  Working in the context of Racket, whose system includes a low-level form of methods, we show how to combine two existing type system features---existential types and occurrence typing--to produce a sound approach to typing method extraction.
Edit intent: clarity
Original:  Working in the context of Racket, whosestructure system includes a low-level form of methods, we show how to combine two existing type system features---existential types and occurrence typing--to produce a sound approach to typing method extraction.
Revised:  Working in the context of Racket, whosestructure system includes a low-level form of methods, we show how to combine two existing type system features-existential types and occurrence typing--to produce a sound approach to typing method extraction.
Edit intent: fluency
Original:  Working in the context of Racket, whosestructure system includes a low-level form of methods, we show how to combine two existing type system features---existential types and occurrence typing--to produce a sound approach to typing method extraction.
Revised:  Working in the context of Racket, whosestructure system includes a low-level form of methods, we show how to combine two existing type system features---existential types and occurrence typing-to produce a sound approach to typing method extraction.
Edit intent: fluency
Original:  Our design is proved sound, has been implemented and shipped in Typed Racket, and works for existing Racket programs using these features .
Revised:  . .
Edit intent: coherence
Original: Many object-oriented dynamic languages allow programmers to extract methodsfrom objects and treat them as functions.
Revised: Many object-oriented dynamic languages allow programmers to _extract methods_ from objects and treat them as functions.
Edit intent: fluency
Original:  In many of these languages, the programmer can then explicitly specify the this value to be used when the method implementation is called.
Revised:  In many of these languages, the programmer can then explicitly specify the `this` value to be used when the method implementation is called.
Edit intent: fluency
Original:  We show how to combine two existing type system features-existential types and occurrence typing-to produce a sound approach to typing method extraction. . .
Revised:  We show how to combine two existing type system features -- existential types and occurrence typing-to produce a sound approach to typing method extraction. . .
Edit intent: fluency
Original:  We show how to combine two existing type system features-existential types and occurrence typing-to produce a sound approach to typing method extraction. . .
Revised:  We show how to combine two existing type system features-existential types and occurrence typing -- to produce a sound approach to typing method extraction. . .
Edit intent: fluency
Original:  Overall, vacancies were down by 60 to 70 \% in the first weeks of \\%DIF > in the first weeks of lockdown.
Revised:  Overall, vacancies were down by 60 to 70 \\%DIF > in the first weeks of lockdown.
Edit intent: fluency
Original:  There are also small but significant changes in the median salary and number of full time and permanent jobs.
Revised:  There are also small but significant changes in the salary distribution and number of full time and permanent jobs.
Edit intent: clarity
Original:  Through the use of automatic differentiation (AD) , we need only to write the constraints in terms of AD objects, where all of the derivatives required for the forward and inverse problems are obtained by appropriately seeding and evaluating these quantities.
Revised:  Through the use of AD , we need only to write the constraints in terms of AD objects, where all of the derivatives required for the forward and inverse problems are obtained by appropriately seeding and evaluating these quantities.
Edit intent: clarity
Original:  Using end-to-end deep learning and benefiting from transfer learning approaches, we reached a validation set challenge performance measure of 56.56 \%.
Revised:  Using end-to-end deep learning and benefiting from transfer learning approaches, we reached a test set challenge performance measure of 56.56 \%.
Edit intent: clarity
Original:  This fundamentally different approach has already been deployed in a publicly downloadable app . It brings a new tool to bear on the pandemic , powered by network theory.
Revised:  This fundamentally different approach has already been deployed in a publicly downloadable app , brings a new tool to bear on the pandemic , powered by network theory.
Edit intent: coherence