wanyu/IteraTeR_v2 huggingface dataset:
Original: The mean filed variational Bayes method is becoming increasingly popular in statistics and machine learning.
Revised: The mean field variational Bayes method is becoming increasingly popular in statistics and machine learning.
Edit intent: fluency
Original:  In addition, we obtained similar optimality results for Gibbs sampling and an iterative procedure to calculate maximum likelihood estimation, which can be of independent interest.
Revised:  In addition, we obtain similar optimality results for Gibbs sampling and an iterative procedure to calculate maximum likelihood estimation, which can be of independent interest.
Edit intent: fluency
Original:  However, ironically, users' attempt to reduce attention to sensitive posts via deletion, in practice, attracts unwanted attention from stalkers , curious friends, and even blackmailers specifically to those (deleted) posts.
Revised:  However, ironically, users' attempt to reduce attention to sensitive posts via deletion, in practice, attracts unwanted attention from stalkers specifically to those (deleted) posts.
Edit intent: clarity
Original:  Thus, in general, deletions may leave users more vulnerable to attacks on their privacy , and users hoping to make their posts forgotten can face a "damned if I do, damned if I don't" dilemma.
Revised:  Thus, in general, deletions may leave users more vulnerable to attacks on their privacy in general. Users hoping to make their posts forgotten can face a "damned if I do, damned if I don't" dilemma.
Edit intent: coherence
Original:  Thus, in general, deletions may leave users more vulnerable to attacks on their privacy , and users hoping to make their posts forgotten can face a "damned if I do, damned if I don't" dilemma.
Revised:  Thus, in general, deletions may leave users more vulnerable to attacks on their privacy , and users hoping to make their posts forgotten face a "damned if I do, damned if I don't" dilemma.
Edit intent: clarity
Original:   In the form of intermittent withdrawals, we propose a rather disruptive solution (Letheia) to this problem of (really) forgetting the forgotten.
Revised:  In the form of intermittent withdrawals, we present, Lethe, a novel solution to this problem of (really) forgetting the forgotten.
Edit intent: clarity
Original:   In the form of intermittent withdrawals, we propose a rather disruptive solution (Letheia) to this problem of (really) forgetting the forgotten.
Revised:  In the form of intermittent withdrawals, we propose a rather disruptive solution (Letheia) to this problem of forgetting the forgotten.
Edit intent: coherence
Original:  If the  platforms are willing to give up the uninterrupted availability of non-deleted posts by a very small fraction, Letheia provides privacy to the deleted posts over long durations.
Revised:  If the platforms are willing to give up the uninterrupted availability of non-deleted posts by a very small fraction, Lethe provides privacy to the deleted posts over long durations.
Edit intent: clarity
Original:  With Letheia , an adversarial observer becomes unsure if some posts are permanently deleted or just temporarily withdrawn  ;
Revised:  In presence of Lethe , an adversarial observer becomes unsure if some posts are permanently deleted or just temporarily withdrawn ;
Edit intent: clarity
Original:  With Letheia , an adversarial observer becomes unsure if some posts are permanently deleted or just temporarily withdrawn  ;
Revised:  With Letheia , an adversarial observer becomes unsure if some posts are permanently deleted or just temporarily withdrawn by Lethe ;
Edit intent: clarity
Original:  For example, we show thatwhile maintaining content availability as high as 95\%, Letheia offers deletion privacy for up to 3 months from the time of deletion while still keeping the adversarial precision to 20\%.
Revised:  For example, we show thatwhile maintaining content availability as high as 95\%, Letheia offers deletion privacy for up to 3 months from the time of deletion , while maintaining content availability as high as 95\% and keeping the adversarial precision to 20\%.
Edit intent: coherence
Original:  Specifically, we answer the following question: for a fixed d  \geq 1, what is the minimal width w so that neural nets with ReLU activations, input dimension d  , hidden layer widths at most w, and arbitrary depth can approximate any continuous  function of d  variables arbitrarily well .
Revised:  Specifically, we answer the following question: for a fixed d \geq 1, what is the minimal width w so that neural nets with ReLU activations, input dimension d , hidden layer widths at most w, and arbitrary depth can approximate any continuous function of d variables arbitrarily well ?
Edit intent: fluency
Original:  On the other hand, we show that any continuous function on the d-dimensional unit cube can be approximated to arbitrary precision by ReLU nets in which all hidden layers have width exactly d  +1.
Revised:  On the other hand, any continuous function on the d-dimensional unit cube can be approximated to arbitrary precision by ReLU nets in which all hidden layers have width exactly d +1.
Edit intent: coherence
Original: We provide the rate of convergence of general monotone schemes for parabolic Hamilton-Jacobi-Bellman  equations in bounded domains with strong Dirichlet boundary conditions.
Revised: We study the approximation of parabolic Hamilton-Jacobi-Bellman equations in bounded domains with strong Dirichlet boundary conditions.
Edit intent: clarity
Original: We provide the rate of convergence of general monotone schemes for parabolic Hamilton-Jacobi-Bellman  equations in bounded domains with strong Dirichlet boundary conditions.
Revised: We provide the rate of convergence of general monotone schemes for parabolic Hamilton-Jacobi-Bellman (HJB) equations in bounded domains with strong Dirichlet boundary conditions.
Edit intent: clarity
Original:  We work under the assumption of the existence of a sufficiently regular barrier function for the problem in order to prove well-posedness and regularity of a related switching system .
Revised:  We work under the assumption of the existence of a sufficiently regular barrier function for the problem to obtain well-posedness and regularity of a related switching system .
Edit intent: clarity
Original:  As special cases we deduce error bounds for  finite difference and (truncated ) semi-Lagrangian schemes.
Revised:  We deduce error bounds for finite difference and (truncated ) semi-Lagrangian schemes.
Edit intent: clarity
Original:  As special cases we deduce error bounds for  finite difference and (truncated ) semi-Lagrangian schemes.
Revised:  As special cases we deduce error bounds for finite difference and truncated semi-Lagrangian schemes.
Edit intent: fluency
Original: We investigate the critical behaviour of a one-parameter probabilistic mixture of one-dimensional elementary cellular automata under the guise of a model for the dynamics of a single-species unstructured population with nonoverlapping generations in which individuals have smaller probability of reproducing and surviving in a crowded neighborhood but also suffer from isolation and dispersal.
Revised: We propose and investigate a one-parameter probabilistic mixture of one-dimensional elementary cellular automata under the guise of a model for the dynamics of a single-species unstructured population with nonoverlapping generations in which individuals have smaller probability of reproducing and surviving in a crowded neighborhood but also suffer from isolation and dispersal.
Edit intent: clarity
Original: We investigate the critical behaviour of a one-parameter probabilistic mixture of one-dimensional elementary cellular automata under the guise of a model for the dynamics of a single-species unstructured population with nonoverlapping generations in which individuals have smaller probability of reproducing and surviving in a crowded neighborhood but also suffer from isolation and dispersal.
Revised: We investigate the critical behaviour of a one-parameter probabilistic mixture of one-dimensional elementary cellular automata under the guise of a model for the dynamics of a single-species unstructured population with nonoverlapping generations in which individuals have smaller probability of reproducing and surviving in a crowded neighbourhood but also suffer from isolation and dispersal.
Edit intent: fluency
Original:  We determine the critical probability separating these two phases and characterise the phase transition between them by finite-size scaling analysis of Monte Carlo data.
Revised:  We determine the critical probability separating these two phases and find that the phase transition between them by finite-size scaling analysis of Monte Carlo data.
Edit intent: clarity
Original:  To solve this, we envision the utilization of completely decentralized mechanisms that enhance Spatial Reuse (SR).
Revised:  To solve this, we envision the utilization of completely decentralized mechanisms to enable Spatial Reuse (SR).
Edit intent: clarity
Original:  In particular, we concentrate in Reinforcement Learning (RL), and more specifically , in Multi-Armed Bandits (MABs), to allow networks to modify both their transmission power and channel based on their experienced throughput .
Revised:  In particular, we concentrate in Reinforcement Learning (RL), and more specifically on Multi-Armed Bandits (MABs), to allow networks to modify both their transmission power and channel based on their experienced throughput .
Edit intent: fluency
Original:  In particular, we concentrate in Reinforcement Learning (RL), and more specifically , in Multi-Armed Bandits (MABs), to allow networks to modify both their transmission power and channel based on their experienced throughput .
Revised:  In particular, we concentrate in Reinforcement Learning (RL), and more specifically , in Multi-Armed Bandits (MABs), to allow networks to learn their best configuration .
Edit intent: clarity
Original:  Our results show that optimal proportional fairness can be achieved, even if no information about neighboring networks is available to the learners and WNs operate selfishly.
Revised:  Our results show that optimal proportional fairness can be achieved, even when no information about neighboring networks is available to the learners and WNs operate selfishly.
Edit intent: fluency
Original:  Our results show that optimal proportional fairness can be achieved, even if no information about neighboring networks is available to the learners and WNs operate selfishly.
Revised:  Our results show that optimal proportional fairness can be achieved, even if no information about neighboring networks is available to the learners and Wireless Networks (WNs) operate selfishly.
Edit intent: clarity
Original:  We also show that this variability is reduced using UCB and Thompson sampling, which are parameter-free policies that perform exploration according to the reward distribution of each action .
Revised:  We also show that learning sequentially, even if using a selfish strategy, contributes to minimize this variability. The sequential approach is therefore shown to effectively deal with the challenges posed by the adversarial settings that are typically found in decentralized WNs .
Edit intent: coherence
Original: In this paper , we investigate the feasibility of using the existing cellular infrastructurefor drone operations.
Revised: This paper studies the feasibility of using the existing cellular infrastructurefor drone operations.
Edit intent: clarity
Original:  Our analytical framework includes base station (BS) height and antenna radiation pattern, drone antenna directivity , and the impact of various propagation environments.
Revised:  Our analytical framework includes base station (BS) height and antenna radiation pattern, drone antenna directivity and various propagation environments.
Edit intent: clarity
Original:  Finally, the impact of network densification is studied which shows the coverage performance of a drone converges to zero considerably faster than that of a ground user, however, lowering the drone flying altitude significantly improves its performance in a very dense network .
Revised:  Finally, the impact of network densification is studied which shows the coverage performance of a drone converges to zero considerably fast, suggesting that ultra-dense networks might be poor candidates for serving aerial users .
Edit intent: clarity
Original:  Both approaches are trained end-to-end, such that the learned model is optimised for its actual use in the planner .
Revised:  Both approaches are trained end-to-end, such that the learned model is optimised for its actual use in the tree .
Edit intent: clarity
Original:  We show that TreeQN and ATreeC outperform n-step DQN and A2C on a box-pushing task, as well as n-step DQN and value prediction networks (Oh et al. , 2017) on multiple Atari games , with deeper trees often outperforming shallower ones.
Revised:  We show that TreeQN and ATreeC outperform n-step DQN and A2C on a box-pushing task, as well as n-step DQN and value prediction networks (Oh et al. 2017) on multiple Atari games , with deeper trees often outperforming shallower ones.
Edit intent: fluency
Original: Within the framework of Kahneman and Tversky's cumulative prospective theory  , this paper considers a continuous-time behavioral portfolio selection model, which includes both running and terminal terms in the objective functional.
Revised: Within the framework of the cumulative prospective theory , this paper considers a continuous-time behavioral portfolio selection model, which includes both running and terminal terms in the objective functional.
Edit intent: clarity
Original: Within the framework of Kahneman and Tversky's cumulative prospective theory  , this paper considers a continuous-time behavioral portfolio selection model, which includes both running and terminal terms in the objective functional.
Revised: Within the framework of Kahneman and Tversky's cumulative prospective theory , this paper considers a continuous-time behavioral portfolio selection problem whose model includes both running and terminal terms in the objective functional.
Edit intent: clarity
Original:  Finally, the results are applied to various cases .
Revised:  Finally, the results are applied to various examples .
Edit intent: clarity
Original:  Our multi-dataset classification model achieves the best prediction performance on several large reference datasets, compared to models without cognitive-aware low-dimension representations ;
Revised:  Our multi-dataset classification model achieves the best prediction performance on several large reference datasets, compared to models without cognitive-aware low-dimension representations ,
Edit intent: fluency
Original:  The concept of IA, though, is originated by the capacity study of interference channels and as such, its performance is mainly gauged under ideal assumptions, such as instantaneous and perfect channel state information (CSI) at all nodes, and a homogeneous signal-to-noise ratio (SNR) regime , i.e., each user has the same average SNR. Consequently, the performance of IA under realistic conditions has not been completely investigated yet.
Revised:  The concept of IA, though, is originated by the capacity study of interference channels and as such, its performance is mainly gauged under ideal assumptions, such as instantaneous and perfect channel state information (CSI) at all nodes, and homogeneous signal-to-noise ratio (SNR) regime , i.e., each user has the same average SNR. Consequently, the performance of IA under realistic conditions has not been completely investigated yet.
Edit intent: fluency
Original:  The concept of IA, though, is originated by the capacity study of interference channels and as such, its performance is mainly gauged under ideal assumptions, such as instantaneous and perfect channel state information (CSI) at all nodes, and a homogeneous signal-to-noise ratio (SNR) regime , i.e., each user has the same average SNR. Consequently, the performance of IA under realistic conditions has not been completely investigated yet.
Revised:  The concept of IA, though, is originated by the capacity study of interference channels and as such, its performance is mainly gauged under ideal assumptions, such as instantaneous and perfect channel state information (CSI) at all nodes, and a homogeneous signal-to-noise ratio (SNR) users , i.e., each user has the same average SNR. Consequently, the performance of IA under realistic conditions has not been completely investigated yet.
Edit intent: clarity
Original:  In particular, this extended numeration system helps to catch occurrences of palindromes in a characteristic Sturmian words and thus to prove for Sturmian words the following conjecture stated in 2013 by Puzynina, Zamboni and the author: If a word is not periodic, then for every Q>0 it has a prefix which cannot be decomposed to a concatenation of at most Q palindromes.
Revised:  In particular, this extended numeration system helps to catch occurrences of palindromes in a characteristic Sturmian word and thus to prove for Sturmian words the following conjecture stated in 2013 by Puzynina, Zamboni and the author: If a word is not periodic, then for every Q>0 it has a prefix which cannot be decomposed to a concatenation of at most Q palindromes.
Edit intent: fluency
Original:  The Izhikevich  model provides an efficient and biologically plausible method to track a cortical neuron's membrane potential and its firing times.
Revised:  The Izhikevich neuron model provides an efficient and biologically plausible method to track a cortical neuron's membrane potential and its firing times.
Edit intent: clarity
Original:  The time required for the neuron to charge and for the neuron to recover to the resting potential are fitted to functions of the Izhikevich  model parameters.
Revised:  The time required for the neuron to charge and for the neuron to recover to the resting potential are fitted to functions of the Izhikevich neuron model parameters.
Edit intent: clarity
Original:  Results show that linear functions of the model parameters can  predict the charging times with some accuracy and are sufficient to estimate the highest firing frequency achievable without interspike interference.
Revised:  Results show that linear functions of the model parameters can be used to predict the charging times with some accuracy and are sufficient to estimate the highest firing frequency achievable without interspike interference.
Edit intent: clarity
Original:  Using Monte Carlo simulation and an heuristic analytical approach based on exact results for the ASEP we make predictions for the RNAP traffic that might be tested in future experiments .
Revised:  Using Monte Carlo simulations and heuristic analytical arguments that combine exact results for the ASEP we make predictions for the RNAP traffic that might be tested in future experiments .
Edit intent: clarity
Original:  It is not only important in predicting elections but plays also an essential role in marketing and the financial industry.
Revised:  It is not only important in predicting elections but also plays an essential role in marketing and the financial industry.
Edit intent: fluency
Original:  In this paper, we determine the exact stretch factor of Delaunay triangulations defined using a hexagon instead of a circle : It is 2.
Revised:  In this paper, we determine the exact stretch factor of Delaunay triangulations defined using a regular hexagon : It is 2.
Edit intent: clarity
Original:  In this paper we propose a more systematic proof method to show that an extensional normal-form bisimilarity along with its corresponding bisimulation up to context  are sound.
Revised:  In this paper we propose a more systematic proof method to show that an extensional normal-form bisimilarity along with its corresponding up to context are sound.
Edit intent: clarity
Original:  We illustrate our technique with three calculi: the call-by-value lambda-calculus  , the call-by-value lambda-calculus  with the delimited-control operators shift and reset, and the call-by-value lambda-calculus  with the abortive control operators call/cc and abort.
Revised:  We illustrate our technique with three calculi: the call-by-value lambda-calculus , the call-by-value lambda-calculus with the delimited-control operators shift and reset, and the call-by-value lambda-calculus -calculus with the abortive control operators call/cc and abort.
Edit intent: clarity
Original:  In the first two cases, there was previously no sound bisimulation up to context validating the eta-law } , whereas no theory of normal-form bisimulations for the calculus of abortive control has been presented before.
Revised:  In the first two cases, there was previously no sound up to context validating the eta-law } , whereas no theory of normal-form bisimulations for the calculus of abortive control has been presented before.
Edit intent: clarity
Original:  In the first two cases, there was previously no sound bisimulation up to context validating the eta-law } , whereas no theory of normal-form bisimulations for the calculus of abortive control has been presented before.
Revised:  In the first two cases, there was previously no sound bisimulation up to context technique validating the } , whereas no theory of normal-form bisimulations for the calculus of abortive control has been presented before.
Edit intent: clarity
Original:  In the first two cases, there was previously no sound bisimulation up to context validating the eta-law } , whereas no theory of normal-form bisimulations for the calculus of abortive control has been presented before.
Revised:  In the first two cases, there was previously no sound bisimulation up to context validating the eta-law } , whereas no theory of normal-form bisimulations for a calculus with call/cc and abort has been presented before.
Edit intent: clarity
Original: Normal-form bisimilarity is a simple, easy-to-use behavioral equivalence that relates terms in \lambda -calculi by decomposing their normal forms into bisimilar subterms.
Revised: Normal-form bisimilarity is a simple, easy-to-use behavioral equivalence that relates terms in \lambda -calculi by decomposing their normal forms into bisimilar subterms.
Edit intent: fluency
Original:  Besides, they allow for powerful up-to techniques, such as bisimulation up to context, which simplify bisimulation proofs even further.
Revised:  Moreover, it typically allows for powerful up-to techniques, such as bisimulation up to context, which simplify bisimulation proofs even further.
Edit intent: coherence
Original:  However, proving soundness of these relations becomes complicated in the presence of \eta -expansion and usually relies on ad hoc proof methods which depend on the language.
Revised:  However, proving soundness of these relations becomes complicated in the presence of \eta -expansion and usually relies on ad hoc proof methods which depend on the language.
Edit intent: fluency
Original:  We illustrate our technique with three calculi: the call-by-value \lambda -calculus, the call-by-value \lambda -calculus with the delimited-control operators shift and reset, and the call-by-value \lambda -calculus with the abortive control operators call/cc and abort.
Revised:  We illustrate our technique with three calculi: the call-by-value \lambda -calculus, the call-by-value \lambda -calculus with the delimited-control operators shift and reset, and the call-by-value \lambda -calculus with the abortive control operators call/cc and abort.
Edit intent: fluency
Original:  In the first two cases, there was previously no sound up to context technique validating the \eta -law, whereas no theory of normal-form bisimulations for a calculus with call/cc and abort has been presented before.
Revised:  In the first two cases, there was previously no sound up to context technique validating the \eta -law, whereas no theory of normal-form bisimulations for a calculus with call/cc and abort has been presented before.
Edit intent: fluency