wanyu/IteraTeR_v2 huggingface dataset:
Original: In 12%DIFDELCMD < ]%%% , the authors introduce an adaptive, stabilized finite element method (FEM), which solves a stable saddle-point problem .
Revised: In %DIFDELCMD < ]%%% , the authors introduce an adaptive, stabilized finite element method (FEM), which solves a stable saddle-point problem .
Edit intent: coherence
Original:  This projection delivers a reliable error estimate that drives mesh refinement by minimizing a discrete energy norm  .
Revised:  This projection delivers a reliable error estimate that drives mesh refinement by minimizing a discrete energy norm via automatic mesh refinement .
Edit intent: clarity
Original:  In this work, we extend this framework to goal-oriented adaptivity (GoA) .
Revised:  In this work, we propose and analyze a goal-oriented adaptivity (GoA) .
Edit intent: clarity
Original:  In this work, we extend this framework to goal-oriented adaptivity (GoA) .
Revised:  In this work, we extend this framework to goal-oriented adaptive algorithm for this stable residual minimization .
Edit intent: clarity
Original:  We solve the primal and adjoint problems using the same initial saddle-point formulation , but with different right-hand sides.
Revised:  We solve the primal and adjoint problems considering the same saddle-point formulation , but with different right-hand sides.
Edit intent: clarity
Original:  We solve the primal and adjoint problems using the same initial saddle-point formulation , but with different right-hand sides.
Revised:  We solve the primal and adjoint problems using the same initial saddle-point formulation and different right-hand sides.
Edit intent: coherence
Original:  In addition, it does not require any prior knowledge on how the objective function is parametrized, since it automatically adjusts its per-coordinate learning rate.
Revised:  In addition, they do not require any prior knowledge on how the objective function is parametrized, since it automatically adjusts its per-coordinate learning rate.
Edit intent: fluency
Original:  In addition, it does not require any prior knowledge on how the objective function is parametrized, since it automatically adjusts its per-coordinate learning rate.
Revised:  In addition, it does not require any prior knowledge on how the objective function is parametrized, since they automatically adjust their per-coordinate learning rate.
Edit intent: fluency
Original:  This can be seen as a truly accelerated AdaGrad method for constrained optimization.
Revised:  These can be seen as a truly accelerated AdaGrad method for constrained optimization.
Edit intent: fluency
Original:  This can be seen as a truly accelerated AdaGrad method for constrained optimization.
Revised:  This can be seen as truly accelerated Adagrad methods for constrained optimization.
Edit intent: fluency
Original:  We complement it with a simpler algorithm AdaGrad+ which enjoys the same features, and achieves the standard non-accelerated convergence rate.
Revised:  We complement them with a simpler algorithm AdaGrad+ which enjoys the same features, and achieves the standard non-accelerated convergence rate.
Edit intent: clarity
Original: The problem of catastrophic forgetting can be traced back to the 1980s, but it has not been completely solved . Since human brains are good at continual lifelong learning, brain-inspired methods may provide solutions to this problem.
Revised: The problem of catastrophic forgetting can be traced back to the 1980s, but it has not been completely solved yet. Since the human brain has natural ability to perform continual lifelong learning, brain-inspired methods may provide solutions to this problem.
Edit intent: coherence
Original: The problem of catastrophic forgetting can be traced back to the 1980s, but it has not been completely solved . Since human brains are good at continual lifelong learning, brain-inspired methods may provide solutions to this problem.
Revised: The problem of catastrophic forgetting can be traced back to the 1980s, but it has not been completely solved . Since human brains are good at continual lifelong learning, learning from the brain may provide solutions to this problem.
Edit intent: clarity
Original:  These results support our assumption that concept formation is essential for continuous lifelong learning , and suggest the AVIM we propose here is a possible mechanism of concept formation , and hence is a brain-like solution to the problem of catastrophic forgetting .
Revised:  These results support our assumption that concept formation is essential for continuous lifelong learning and suggest the AVIM we propose here is a possible mechanism of concept formation , and hence is a brain-like solution to the problem of catastrophic forgetting .
Edit intent: fluency
Original:  These results support our assumption that concept formation is essential for continuous lifelong learning , and suggest the AVIM we propose here is a possible mechanism of concept formation , and hence is a brain-like solution to the problem of catastrophic forgetting .
Revised:  These results support our assumption that concept formation is essential for continuous lifelong learning , and suggest the proposed AVIM is a possible mechanism of concept formation , and hence is a brain-like solution to the problem of catastrophic forgetting .
Edit intent: coherence
Original:  These results support our assumption that concept formation is essential for continuous lifelong learning , and suggest the AVIM we propose here is a possible mechanism of concept formation , and hence is a brain-like solution to the problem of catastrophic forgetting .
Revised:  These results support our assumption that concept formation is essential for continuous lifelong learning , and suggest the AVIM we propose here is a possible concept formation mechanism .
Edit intent: coherence
Original:  The proof of that result is based on a previous result of Bournez et al. on the Turing-completeness of polynomial ordinary differential equations with polynomial initial conditions (PIVP).
Revised:  The proof of that result is based on a previous result of Bournez et al. on the Turing-completeness of polyno-mial ordinary differential equations with polynomial initial conditions (PIVP).
Edit intent: fluency
Original:  Our main finding is that local linear stability is not guaranteed even when the scheme is non-linearly stable and that this has grave implications for simulation results.
Revised:  Our main finding is that local linear stability is not guaranteed even when the scheme is non-linearly stable and that this may have adverse implications for simulation results.
Edit intent: clarity
Original:  For the non-linear Burgers equation, we  demonstrate numerically that such schemes cause exponential growth of errors  .
Revised:  For the non-linear Burgers equation, we demonstrate numerically that such schemes cause exponential growth of errors during the simulation .
Edit intent: clarity
Original:  Furthermore, we demonstrate a similar abnormal behaviour for the compressible Euler equations  .
Revised:  Furthermore, we encounter a similar abnormal behaviour for the compressible Euler equations .
Edit intent: clarity
Original:  Finally,  we demonstrate numerically that other commonly used split-forms, such as the Kennedy and Gruber splitting, are also locally linearly unstable.
Revised:  Finally, we demonstrate numerically that other commonly known split-forms, such as the Kennedy and Gruber splitting, are also locally linearly unstable.
Edit intent: clarity
Original: We study the classic problem of matching n agents to n objects, where the agents have ranked preferences over the objects.
Revised: We study the classical problem of matching n agents to n objects, where the agents have ranked preferences over the objects.
Edit intent: fluency
Original:  We also study online algorithms to elicit partial preferences adaptively, and prove bounds on their competitive ratio.
Revised:  We also study online algorithms for eliciting partial preferences adaptively, and prove bounds on their competitive ratio.
Edit intent: fluency
Original:  Lastly, we define k-reachable groups in analogy with synchronizing groups \le \le  .
Revised:  Lastly, we define k-reachable groups in analogy with synchronizing groups \le k\le .
Edit intent: clarity
Original:  processor cores are an interesting approach to pursue the highest energy efficiency and lowest hardware cost in edge computing systems ,
Revised:  processor cores are interesting to pursue energy efficiency and lowest hardware cost in edge computing systems ,
Edit intent: clarity
Original:  processor cores are an interesting approach to pursue the highest energy efficiency and lowest hardware cost in edge computing systems ,
Revised:  processor cores are an interesting approach to pursue the highest energy efficiency and low hardware cost for edge-computing ,
Edit intent: clarity
Original:  yet they need hardware acceleration schemes to deal with heavy computational workloads like convolutional algorithms . Following a vector approach to accelerate convolutions , this study explores possible alternatives to implement vector coprocessing units in IMT cores, showing the application-dependence of the optimal balance among the hardware architecture parameters .
Revised:  yet they need hardware acceleration schemes to run heavy computational workloads like convolutional algorithms . Following a vector approach to accelerate convolutions , this study explores possible alternatives to implement vector coprocessing units in IMT cores, showing the application-dependence of the optimal balance among the hardware architecture parameters .
Edit intent: clarity
Original:  yet they need hardware acceleration schemes to deal with heavy computational workloads like convolutional algorithms . Following a vector approach to accelerate convolutions , this study explores possible alternatives to implement vector coprocessing units in IMT cores, showing the application-dependence of the optimal balance among the hardware architecture parameters .
Revised:  yet they need hardware acceleration schemes to deal with heavy computational workloads . Following a vector approach to accelerate convolutions , this study explores possible alternatives to implement vector coprocessing units in IMT cores, showing the application-dependence of the optimal balance among the hardware architecture parameters .
Edit intent: clarity
Original:  yet they need hardware acceleration schemes to deal with heavy computational workloads like convolutional algorithms . Following a vector approach to accelerate convolutions , this study explores possible alternatives to implement vector coprocessing units in IMT cores, showing the application-dependence of the optimal balance among the hardware architecture parameters .
Revised:  yet they need hardware acceleration schemes to deal with heavy computational workloads like convolutional algorithms . Following a vector approach to accelerate computations , this study explores possible alternatives to implement vector coprocessing units in IMT cores, showing the application-dependence of the optimal balance among the hardware architecture parameters .
Edit intent: clarity
Original: We initiate the study of fair allocations of a mixed mannaunder the popular fairness notion of maximin share (MMS)  . A mixed manna allows an item to be a good for some agents and  chore for others , hence strictly generalizes the well-studied goods (chores) only manna.
Revised: In this paper we initiate the study of fair allocations of a mixed mannaunder the popular fairness notion of maximin share (MMS) . A mixed manna allows an item to be a good for some agents and chore for others , hence strictly generalizes the well-studied goods (chores) only manna.
Edit intent: clarity
Original: We initiate the study of fair allocations of a mixed mannaunder the popular fairness notion of maximin share (MMS)  . A mixed manna allows an item to be a good for some agents and  chore for others , hence strictly generalizes the well-studied goods (chores) only manna.
Revised: We initiate the study of fair allocations of a mixed mannaunder the popular fairness notion of maximin share (MMS) . A mixed manna allows an item to be a good for some agents and a chore for others , hence strictly generalizes the well-studied goods (chores) only manna.
Edit intent: fluency
Original:  For the good manna, Procaccia and Wang PW14%DIFDELCMD < ] %%% showed non-existence of MMS allocation.
Revised:  For the good manna, Procaccia and Wang %DIFDELCMD < ] %%% showed non-existence of MMS allocation.
Edit intent: clarity
Original:  Computing an \alpha-MMS allocation for the maximum \alpha for   which it exists is known to be NP-hard.
Revised:  Computing an \alpha-MMS allocation for the maximum \alpha for for which it exists is known to be NP-hard.
Edit intent: fluency
Original:  But the question of finding \alpha-MMS for the near best%DIFDELCMD < \alpharemains %%% unresolved .
Revised:  But the question of finding \alpha-MMS %DIFDELCMD < \alpharemains %%% unresolved .
Edit intent: clarity
Original:  The  conditions are: (i) number of agents is  constant, and (ii) for every agent, her total value for goods differs significantly from that for chores.
Revised:  The two conditions are: (i) number of agents is constant, and (ii) for every agent, her total value for goods differs significantly from that for chores.
Edit intent: clarity
Original:  The  conditions are: (i) number of agents is  constant, and (ii) for every agent, her total value for goods differs significantly from that for chores.
Revised:  The conditions are: (i) number of agents is a constant, and (ii) for every agent, her total value for goods differs significantly from that for chores.
Edit intent: fluency
Original:  For instances satisfying (i) and (ii) we design a PTAS - an efficient algorithm to find  (\alpha-\epsilon)-MMS allocation given \epsilon >0 for the best possible \alpha.
Revised:  For instances satisfying (i) and (ii) we design a PTAS - an efficient algorithm to find an (\alpha-\epsilon)-MMS allocation given \epsilon >0 for the best possible \alpha.
Edit intent: fluency
Original:  We also  show that if either condition is not satisfied then finding  \alpha-MMS  for any \alpha\in(0,1] is NP-hard, even when  solution exists for \alpha=1.
Revised:  We also show that if either condition is not satisfied then finding an \alpha-MMS for any \alpha\in(0,1] is NP-hard, even when solution exists for \alpha=1.
Edit intent: fluency
Original:  We also  show that if either condition is not satisfied then finding  \alpha-MMS  for any \alpha\in(0,1] is NP-hard, even when  solution exists for \alpha=1.
Revised:  We also show that if either condition is not satisfied then finding \alpha-MMS for any \alpha\in(0,1] is NP-hard, even when a solution exists for \alpha=1.
Edit intent: fluency
Original: Ridesharing and ridesourcing services have become widespread, and properly pricing rides is a crucial problem for these services .
Revised: Ridesharing and ridesourcing services have become widespread, and pricing the rides is a crucial problem for these services .
Edit intent: clarity
Original: Ridesharing and ridesourcing services have become widespread, and properly pricing rides is a crucial problem for these services .
Revised: Ridesharing and ridesourcing services have become widespread, and properly pricing rides is a crucial problem for these systems .
Edit intent: clarity
Original:  We propose and analyze a budget-balanced and strategy-proof mechanism , the Weighted Minimum Surplus (WMS) auction, for the dynamic ridesharing problem with multiple passengers per ride.
Revised:  We propose and analyze a budget-balanced and strategy-proof auction , the Weighted Minimum Surplus (WMS) auction, for the dynamic ridesharing problem with multiple passengers per ride.
Edit intent: clarity
Original:  We also propose and analyze a budget-balanced version of the well-known VCG mechanism, the VCG_s. Under the assumption of downward closed alternatives, we obtain a lower bound for the surplus welfare and surplus profit of the WMS  . Finally, we present an exact algorithm based on integer linear programming to solve these auctions.
Revised:  Under the assumption of downward closed alternatives, we obtain a lower bound for the surplus welfare and surplus profit of the WMS . Finally, we present an exact algorithm based on integer linear programming to solve these auctions.
Edit intent: coherence
Original:  We also propose and analyze a budget-balanced version of the well-known VCG mechanism, the VCG_s. Under the assumption of downward closed alternatives, we obtain a lower bound for the surplus welfare and surplus profit of the WMS  . Finally, we present an exact algorithm based on integer linear programming to solve these auctions.
Revised:  We also propose and analyze a budget-balanced version of the well-known VCG mechanism, the VCG_s. Under the assumption of downward closed alternatives, we obtain lower bounds for the surplus welfare and surplus profit of the WMS . Finally, we present an exact algorithm based on integer linear programming to solve these auctions.
Edit intent: fluency
Original:  We also propose and analyze a budget-balanced version of the well-known VCG mechanism, the VCG_s. Under the assumption of downward closed alternatives, we obtain a lower bound for the surplus welfare and surplus profit of the WMS  . Finally, we present an exact algorithm based on integer linear programming to solve these auctions.
Revised:  We also propose and analyze a budget-balanced version of the well-known VCG mechanism, the VCG_s. Under the assumption of downward closed alternatives, we obtain a lower bound for the surplus welfare and surplus profit of the WMS . 
Edit intent: coherence
Original:  Encouraging experimental results of profit and welfare were obtained for both the WMS auction and the VCG_s.
Revised:  Encouraging experimental results were obtained for both the WMS auction and the VCG_s.
Edit intent: clarity
Original:  This mechanism can be interpreted as a form of self-consistency between the maximum a posteriori (MAP) estimation of the internal generative model and the external environmental .
Revised:  This mechanism can be interpreted as a form of self-consistency between the maximum a posteriori (MAP) estimation of an internal generative model and the external environmental .
Edit intent: fluency
Original:  This mechanism can be interpreted as a form of self-consistency between the maximum a posteriori (MAP) estimation of the internal generative model and the external environmental .
Revised:  This mechanism can be interpreted as a form of self-consistency between the maximum a posteriori (MAP) estimation of the internal generative model and the external environment .
Edit intent: fluency
Original:  Inspired by this , we enforce consistency in neural networks by incorporating generative recurrent feedback.
Revised:  Inspired by such hypothesis , we enforce consistency in neural networks by incorporating generative recurrent feedback.
Edit intent: clarity
Original:  Inspired by this , we enforce consistency in neural networks by incorporating generative recurrent feedback.
Revised:  Inspired by this , we enforce self-consistency in neural networks by incorporating generative recurrent feedback.
Edit intent: clarity
Original:  We instantiate it on convolutional neural networks (CNNs).
Revised:  We instantiate this design on convolutional neural networks (CNNs).
Edit intent: clarity
Original:  The proposed framework, termed Convolutional Neural Networks with Feedback (CNN-F), introduces a generative feedback with latent variables into existing CNN architectures, making consistent predictions via alternating MAP inference under a Bayesian framework.
Revised:  The proposed framework, termed Convolutional Neural Networks with Feedback (CNN-F), introduces a generative feedback with latent variables to existing CNN architectures, making consistent predictions via alternating MAP inference under a Bayesian framework.
Edit intent: fluency
Original:  The proposed framework, termed Convolutional Neural Networks with Feedback (CNN-F), introduces a generative feedback with latent variables into existing CNN architectures, making consistent predictions via alternating MAP inference under a Bayesian framework.
Revised:  The proposed framework, termed Convolutional Neural Networks with Feedback (CNN-F), introduces a generative feedback with latent variables into existing CNN architectures, where consistent predictions are made through alternating MAP inference under a Bayesian framework.
Edit intent: clarity
Original:   CNN-F shows considerably better adversarial robustness over regular feedforward CNNs on standard benchmarks .
Revised:  CNN-F shows considerably improved adversarial robustness over regular feedforward CNNs on standard benchmarks .
Edit intent: coherence
Original:   CNN-F shows considerably better adversarial robustness over regular feedforward CNNs on standard benchmarks .
Revised:  CNN-F shows considerably better adversarial robustness over conventional feedforward CNNs on standard benchmarks .
Edit intent: clarity
Original:  We develop an exact mixed-integer linear optimization formulation, as well as an efficient block coordinate descent algorithm, that enable us to compute  near-optimal hashing schemes for elements seen in the observed stream prefix;
Revised:  We develop an exact mixed-integer linear optimization formulation, which enables us to compute near-optimal hashing schemes for elements seen in the observed stream prefix;
Edit intent: coherence
Original: Quantile aggregation with dependence uncertainty has a long history in probability theory with wide applications in problems in finance, risk management, statistics, and operations research.
Revised: Quantile aggregation with dependence uncertainty has a long history in probability theory with wide applications in finance, risk management, statistics, and operations research.
Edit intent: clarity
Original:  Using a recent result on inf-convolution of Range-Value-at-Risk, which includes Value-at-Risk and Expected Shortfall as special cases, we establish new analytical bounds  which we call convolution bounds.
Revised:  Using a recent result on inf-convolution of quantile-based risk measures, we establish new analytical bounds which we call convolution bounds.
Edit intent: clarity
Original:  The convolution bound enjoys several advantages, including interpretability  , tractability and theoretical properties.
Revised:  The convolution bound enjoys several advantages, including interpretability , and theoretical properties.
Edit intent: clarity
Original:   The security of this approach rests upon the difficulty of learning the model parameters of interacting agents  , a problem which we conjecture is also hard for quantum computing.
Revised:  The security of this approach rests upon the difficulty of modeling the decisions of interacting agents , a problem which we conjecture is also hard for quantum computing.
Edit intent: clarity
Original:  Moreover, we use reinforcement learning techniques  to train server policies which effectively probe the client's decisions to achieve more sample-efficient authentication , while making modelling attacks as difficult as possible via entropy-maximization principles.
Revised:  Moreover, we use reinforcement learning techniques can be used to train server policies which effectively probe the client's decisions to achieve more sample-efficient authentication , while making modelling attacks as difficult as possible via entropy-maximization principles.
Edit intent: coherence
Original:  Moreover, we use reinforcement learning techniques  to train server policies which effectively probe the client's decisions to achieve more sample-efficient authentication , while making modelling attacks as difficult as possible via entropy-maximization principles.
Revised:  Moreover, we use reinforcement learning techniques to train server models which effectively probe the client's decisions to achieve more sample-efficient authentication , while making modelling attacks as difficult as possible via entropy-maximization principles.
Edit intent: clarity