wanyu/IteraTeR_v2 huggingface dataset:
Original:  Together with the public belief, this Bayesian update effectively defines a new Markov decision process, the public belief MDP, in which the action space consists of  deterministic partial policies, parameterised by neural networks, that can be sampled for a given public state.
Revised:  BAD introduces a new Markov decision process, the public belief MDP, in which the action space consists of deterministic partial policies, parameterised by neural networks, that can be sampled for a given public state.
Edit intent: coherence
Original:  Together with the public belief, this Bayesian update effectively defines a new Markov decision process, the public belief MDP, in which the action space consists of  deterministic partial policies, parameterised by neural networks, that can be sampled for a given public state.
Revised:  Together with the public belief, this Bayesian update effectively defines a new Markov decision process, the public belief MDP, in which the action space consists of all deterministic partial policies, parameterised by neural networks, that can be sampled for a given public state.
Edit intent: clarity
Original:  BAD exploits the fact that an agent acting only on this public belief state can still learn to use its private information if the action space is augmented to be over  partial policies mapping private information into environment actions.
Revised:  BAD exploits the fact that an agent acting only on this public belief state can still learn to use its private information if the action space is augmented to be over all partial policies mapping private information into environment actions.
Edit intent: clarity
Original:  The Bayesian update is also closely related to the theory of mind reasoning that humans carry out when observing others' actions.
Revised:  The Bayesian update is closely related to the theory of mind reasoning that humans carry out when observing others' actions.
Edit intent: clarity
Original:  We then evaluate BAD on the challenging, cooperative partial-information card game Hanabi, where  in the two-player setting the method surpasses all previously published learning and hand-coded approaches  establishing a new state of the art.
Revised:  We then evaluate BAD on the challenging, cooperative partial-information card game Hanabi, where , in the two-player setting the method surpasses all previously published learning and hand-coded approaches establishing a new state of the art.
Edit intent: fluency
Original:  We then evaluate BAD on the challenging, cooperative partial-information card game Hanabi, where  in the two-player setting the method surpasses all previously published learning and hand-coded approaches  establishing a new state of the art.
Revised:  We then evaluate BAD on the challenging, cooperative partial-information card game Hanabi, where in the two-player setting , it surpasses all previously published learning and hand-coded approaches establishing a new state of the art.
Edit intent: clarity
Original:  We then evaluate BAD on the challenging, cooperative partial-information card game Hanabi, where  in the two-player setting the method surpasses all previously published learning and hand-coded approaches  establishing a new state of the art.
Revised:  We then evaluate BAD on the challenging, cooperative partial-information card game Hanabi, where in the two-player setting the method surpasses all previously published learning and hand-coded approaches , establishing a new state of the art.
Edit intent: fluency
Original:  Finally, multiple description structural dis-similarity distance loss is imposed on multiple description decoded images in pixel domain for diversified multiple description generations rather than on feature tensors in feature domain, in addition to multiple description reconstruction loss.
Revised:  Finally, multiple description structural dissimilarity distance loss is imposed on multiple description decoded images in pixel domain for diversified multiple description generations rather than on feature tensors in feature domain, in addition to multiple description reconstruction loss.
Edit intent: fluency
Original: In this paper, we propose a new method for removing all the redundant inequalities generated by Fourier-Motzkin Elimination .
Revised: In this paper, we propose a new method for removing all the redundant inequalities generated by Fourier-Motzkin elimination .
Edit intent: fluency
Original:  This method is based on Kohler's work and an improved version of Balas' work  .
Revised:  This method is based on an improved version of Balas' work .
Edit intent: coherence
Original:  Moreover, this method only uses arithmetic operations on matrices  . Algebraic complexity estimates and experimental results show that our method outperforms alternative approaches  based on linear programming  .
Revised:  Moreover, our method only uses arithmetic operations on matrices . Algebraic complexity estimates and experimental results show that our method outperforms alternative approaches based on linear programming .
Edit intent: coherence
Original:  Moreover, this method only uses arithmetic operations on matrices  . Algebraic complexity estimates and experimental results show that our method outperforms alternative approaches  based on linear programming  .
Revised:  Moreover, this method only uses arithmetic operations on matrices and avoids resorting to linear programming techniques . Algebraic complexity estimates and experimental results show that our method outperforms alternative approaches based on linear programming .
Edit intent: clarity
Original:  Moreover, this method only uses arithmetic operations on matrices  . Algebraic complexity estimates and experimental results show that our method outperforms alternative approaches  based on linear programming  .
Revised:  Moreover, this method only uses arithmetic operations on matrices . Algebraic complexity estimates and experimental results show that our method outperforms alternative approaches , in particular those based on linear programming .
Edit intent: clarity
Original:  Further, we recover the convergence orders of the numerical invariant measures, depending on the regularity of noise,  based on an easy time-independent weak error analysis without relying on Malliavin calculus.
Revised:  Further, convergence orders of the numerical invariant measures, depending on the regularity of noise, based on an easy time-independent weak error analysis without relying on Malliavin calculus.
Edit intent: coherence
Original:  Further, we recover the convergence orders of the numerical invariant measures, depending on the regularity of noise,  based on an easy time-independent weak error analysis without relying on Malliavin calculus.
Revised:  Further, we recover the convergence orders of the numerical invariant measures, depending on the regularity of noise, are recovered based on an easy time-independent weak error analysis without relying on Malliavin calculus.
Edit intent: clarity
Original:  Our results provide new insights into how deep learning can be implemented in the brain.
Revised:  Our results provide new insights into how deep learning may be implemented in the brain.
Edit intent: clarity
Original: The convergence rate of multigrid methods can be analyzed using local Fourier analysis .
Revised: Local Fourier analysis is a commonly used tool to assess the quality of geometric multigrid methods for translationally invariant operators. In this paper we completely automate the process of local Fourier analysis .
Edit intent: clarity
Original:  By a special focus on the underlying structure we are able to fully automatize the local Fourier analysis by additional preprocessing in position space.
Revised:  By a special focus on the underlying structure we are able to fully automate the process of local Fourier analysis by additional preprocessing in position space.
Edit intent: clarity
Original:  In this paper we completely automate the process of local Fourier analysis and generalize it to arbitrary, including non-orthogonal, repetitive structures.
Revised:  In this paper we automate the process of local Fourier analysis and generalize it to arbitrary, including non-orthogonal, repetitive structures.
Edit intent: coherence
Original:  In this paper we completely automate the process of local Fourier analysis and generalize it to arbitrary, including non-orthogonal, repetitive structures.
Revised:  In this paper we completely automate the process of local Fourier analysis and present a framework that can be applied to arbitrary, including non-orthogonal, repetitive structures.
Edit intent: clarity
Original:  Based on this definition we are able to fully automate the process of local Fourier analysis both with respect to spatial manipulations of operators as well as the Fourier analysis back-end.
Revised:  Based on this definition we are able to automate the process of local Fourier analysis both with respect to spatial manipulations of operators as well as the Fourier analysis back-end.
Edit intent: coherence
Original: We use recent developments in the area of high dimensional expanders and corresponding high dimensional walks to design an FPRAS to count the number of bases of any matroid given by an independent set oracle, and to estimate the partition function of the random cluster model of any matroid in the regime where 0<q<1.
Revised: We design an FPRAS to count the number of bases of any matroid given by an independent set oracle, and to estimate the partition function of the random cluster model of any matroid in the regime where 0<q<1.
Edit intent: coherence
Original: To forecast political elections, popular pollsters  gather polls and combine information from them with fundamental data such as historical trends, the national economy, and incumbency.
Revised: To forecast political elections, popular pollsters and forecasters gather polls and combine information from them with fundamental data such as historical trends, the national economy, and incumbency.
Edit intent: clarity
Original:  With the goal of shedding light on election forecasts (using the United States as an example), we develop a framework for forecasting elections from the perspective of dynamical systems.
Revised:  With the goal of shedding light on election forecasts (using the United States as an example), we develop a theory for forecasting elections from the perspective of dynamical systems.
Edit intent: clarity
Original:  We conclude by forecasting the senatorial and gubernatorial races in the 2018 U.S. midterm elections of 6  November.
Revised:  We conclude with our forecast of the senatorial and gubernatorial races in the 2018 U.S. midterm elections of 6 November.
Edit intent: clarity
Original:  Through a simple approach that borrows ideas from epidemiology, we show how to combine a compartmental model of disease spreading with public polling data to forecast gubernatorial, senatorial, and presidential elections at the state level.
Revised:  Our model borrows ideas from epidemiology, we show how to combine a compartmental model of disease spreading with public polling data to forecast gubernatorial, senatorial, and presidential elections at the state level.
Edit intent: clarity
Original:  We conclude with our forecast of the senatorial and gubernatorial races in the 2018 U.S. midterm elections of 6 November , which we posted online as a preprint on 5 November.
Revised:  We conclude with our forecast of the senatorial and gubernatorial races on 6 November , which we posted online as a preprint on 5 November.
Edit intent: clarity
Original:  We conclude with our forecast of the senatorial and gubernatorial races in the 2018 U.S. midterm elections of 6 November , which we posted online as a preprint on 5 November.
Revised:  We conclude with our forecast of the senatorial and gubernatorial races in the 2018 U.S. midterm elections of 6 November , which we posted on 5 November.
Edit intent: clarity
Original: Forecasting elections --- a challenging, high-stakes problem --- is the subject of much uncertainty, subjectivity, and media scrutiny.
Revised: Forecasting elections -- a challenging, high-stakes problem --- is the subject of much uncertainty, subjectivity, and media scrutiny.
Edit intent: fluency
Original: Forecasting elections --- a challenging, high-stakes problem --- is the subject of much uncertainty, subjectivity, and media scrutiny.
Revised: Forecasting elections --- a challenging, high-stakes problem -- is the subject of much uncertainty, subjectivity, and media scrutiny.
Edit intent: fluency
Original:  To shed light on this process, we develop a theory for forecasting elections from the perspective of dynamical systems.
Revised:  To shed light on this process, we develop a method for forecasting elections from the perspective of dynamical systems.
Edit intent: clarity
Original:  Surprisingly, our general model performs as well as popular forecasters for the 2012 and 2016 U.S. races for president, Senate, and governor .
Revised:  Surprisingly, our general model performs as well as popular forecasters for the 2012 and 2016 U.S. races for president, senators, and governors .
Edit intent: fluency
Original:  Although contagion and voting dynamics differ, our work suggests a new approach to elucidate how elections are related across states.
Revised:  Although contagion and voting dynamics differ, our work suggests a valuable approach to elucidate how elections are related across states.
Edit intent: clarity
Original:  It also illustrates the effect of accounting for uncertainty in different ways, provides an illuminating example of data-driven forecasting using dynamical systems, and suggests avenues for future research on political elections.
Revised:  It also illustrates the effect of accounting for uncertainty in different ways, provides an example of data-driven forecasting using dynamical systems, and suggests avenues for future research on political elections.
Edit intent: clarity
Original:  We conclude with our forecast of the senatorial and gubernatorial races on 6~November 2018, which we posted on 5 November .
Revised:  We conclude with our forecasts for the senatorial and gubernatorial races on 6~November 2018, which we posted on 5 November .
Edit intent: fluency
Original:  We conclude with our forecast of the senatorial and gubernatorial races on 6~November 2018, which we posted on 5 November .
Revised:  We conclude with our forecast of the senatorial and gubernatorial races on 6~November 2018, which we posted on 5 November 2018.
Edit intent: fluency
Original: We develop a new multipoint stress mixed finite element method for linear elasticity with weak stress symmetry on quadrilateral grids  .
Revised: We develop a multipoint stress mixed finite element method for linear elasticity with weak stress symmetry on quadrilateral grids .
Edit intent: clarity
Original:  The method is developed on simplicial grids in part one of this sequence [ 3 ].
Revised:  The method is developed on simplicial grids in [ 3 ].
Edit intent: clarity
Original:  The second uses a piecewise linear rotation and trapezoidal quadrature rule for the asymmetry bilinear form.
Revised:  The second uses a continuous piecewise bilinear rotation and trapezoidal quadrature rule for the asymmetry bilinear form.
Edit intent: clarity
Original:  The theory enables a systematic classification of all existing G-CNNs in terms of their group of symmetry , base space, and field type (e. g. scalar, vector, or tensor field, etc.).
Revised:  The theory enables a systematic classification of all existing G-CNNs in terms of their symmetry group , base space, and field type (e. g. scalar, vector, or tensor field, etc.).
Edit intent: clarity
Original: The emerging theory of graph limits exhibits an interesting analytic perspective on graphs, showing that many important concepts and tools in graph theory and its applications can be described naturally in analytic language.
Revised: The emerging theory of graph limits exhibits an analytic perspective on graphs, showing that many important concepts and tools in graph theory and its applications can be described naturally in analytic language.
Edit intent: clarity
Original:  For example, we describe how one can use the analytic machinery to obtain a new  proof of the ordered graph removal lemma [Alon et al., FOCS 2017 ].
Revised:  For example, we describe how one can use the analytic machinery to obtain a newnot proof of the ordered graph removal lemma [Alon et al., FOCS 2017 ].
Edit intent: fluency
Original:  For example, we describe how one can use the analytic machinery to obtain a new  proof of the ordered graph removal lemma [Alon et al., FOCS 2017 ].
Revised:  For example, we describe how one can use the analytic machinery to obtain a new proof of the ordered graph removal lemma [Alon et al., FOCS '17 ].
Edit intent: clarity
Original: We formulate the sparse matrix bipartitioning problem of minimizing the communication volume in parallel sparse matrix-vector multiplication.
Revised: We investigate sparse matrix bipartitioning problem of minimizing the communication volume in parallel sparse matrix-vector multiplication.
Edit intent: clarity
Original: We formulate the sparse matrix bipartitioning problem of minimizing the communication volume in parallel sparse matrix-vector multiplication.
Revised: We formulate the sparse matrix bipartitioning -- a problem where we minimize the communication volume in parallel sparse matrix-vector multiplication.
Edit intent: clarity
Original: In this paper, we present STAR, a new distributed and replicated in-memory database  .
Revised: In this paper, we present STAR, a new distributed in-memory database .
Edit intent: clarity
Original:  The key idea is a new phase-switching algorithm where the execution of single-partition and cross-partition transactions are separated.
Revised:  The key idea is a new phase-switching algorithm where the execution of single-partition and cross-partition transactions is separated.
Edit intent: fluency
Original:  In the single-master phase, mastership for the entire database is switched to a designated coordinator node, which can execute these transactions without the use of expensive coordination protocols like two-phase commit.
Revised:  In the single-master phase, mastership for the entire database is switched to a single designated master node, which can execute these transactions without the use of expensive coordination protocols like two-phase commit.
Edit intent: clarity
Original:  Because the coordinator node has a full copy of the database, this phase-switching can be done at negligible cost.
Revised:  Because the master node has a full copy of the database, this phase-switching can be done at negligible cost.
Edit intent: clarity
Original:  We then identify three estimators of these exponents that are proven to be statistically consistent -- that is, converging to the true exponent value for any regularly varying distribution -- and that satisfy some additional niceness requirements  .
Revised:  We then identify three estimators of these exponents that are proven to be statistically consistent -- that is, converging to the true value of the exponent for any regularly varying distribution -- and that satisfy some additional niceness requirements .
Edit intent: clarity
Original:  Commonly, the objective function of  PFHS design is based on the responses of simulations.
Revised:  Commonly, the objective function of the PFHS design is based on the responses of simulations.
Edit intent: fluency
Original:  Compared with existing studies, the purpose of this work is to transfer from image-based model to analysis-based model  for heat sink designs.
Revised:  Compared with existing studies, the purpose of this study is to transfer from image-based model to analysis-based model for heat sink designs.
Edit intent: clarity
Original:  Compared with existing studies, the purpose of this work is to transfer from image-based model to analysis-based model  for heat sink designs.
Revised:  Compared with existing studies, the purpose of this work is to transfer from analysis-based model for heat sink designs.
Edit intent: clarity
Original:  Compared with existing studies, the purpose of this work is to transfer from image-based model to analysis-based model  for heat sink designs.
Revised:  Compared with existing studies, the purpose of this work is to transfer from image-based model to analysis-based model to image-based one for heat sink designs.
Edit intent: clarity
Original:  Numerical experiments show that the ALS is converging towards the exact solution (although a rigorous and general theoretical framework is missing for our application) .
Revised:  Numerical experiments show that the ALS is converging towards the exact solution .
Edit intent: coherence
Original:  Taken together, these results suggest that CNN could be used to reveal structure components of neuronal circuits, and provide a powerful model for neural system identification.
Revised:  Taken together, these results suggest that CNNs could be used to reveal structure components of neuronal circuits, and provide a powerful model for neural system identification.
Edit intent: fluency
Original:  The life cycle of the single-celled monograph organism is predicted in molecular detail as the aggregate of the possible sequentializations of the coded-for processes.
Revised:  The life cycle of the single-celled monograph organism is predicted in molecular detail as the possible sequentializations of the coded-for processes.
Edit intent: clarity
Original: We axiomatize the molecular-biology reasoning style, verify compliance of the standard reference: Ptashne, A Genetic Switch, and present proof-theory-induced technologies to predict phenotypes and life cycles from genotypes.
Revised: We axiomatize the molecular-biology reasoning style, show compliance of the standard reference: Ptashne, A Genetic Switch, and present proof-theory-induced technologies to predict phenotypes and life cycles from genotypes.
Edit intent: coherence
Original: We axiomatize the molecular-biology reasoning style, verify compliance of the standard reference: Ptashne, A Genetic Switch, and present proof-theory-induced technologies to predict phenotypes and life cycles from genotypes.
Revised: We axiomatize the molecular-biology reasoning style, verify compliance of the standard reference: Ptashne, A Genetic Switch, and present proof-theory-induced technologies to help infer phenotypes and to predict life cycles from genotypes.
Edit intent: clarity
Original:  The key is to note that `reductionist discipline' entails constructive reasoning , i.e., that any argument for a compound property is constructed from more basic arguments . Proof theory makes explicit the inner structure of the axiomatized reasoning style and allows the permissible dynamics to be presented as a mode of computation that can be executed and analyzed.
Revised:  The key is to note that `reductionist discipline' entails constructive reasoning : any proof of a compound property is constructed from more basic arguments . Proof theory makes explicit the inner structure of the axiomatized reasoning style and allows the permissible dynamics to be presented as a mode of computation that can be executed and analyzed.
Edit intent: clarity
Original:  Constructivity and executability guarantee simulation when working over domain-specific languages.
Revised:  Constructivity and execution guarantee simulation when working over domain-specific languages.
Edit intent: clarity
Original:  A main implication of our construction is that technical correctness provides a complementary perspective on science that is as fundamental there as it is for pure mathematics , provided mature reductionism exists .
Revised:  A main implication of our construction is that formal correctness provides a complementary perspective on science that is as fundamental there as it is for pure mathematics , provided mature reductionism exists .
Edit intent: clarity