wanyu/IteraTeR_v2 huggingface dataset:
Original:  While theoretical approaches to the problem have hit some limits, arecent research direction initiated by Duetting et al. (2019) consists in building neural networkarchitectures to find optimal auctions.
Revised:  While theoretical approaches to the problem have hit some limits, a recent research direction initiated by Duetting et al. (2019) consists in building neural networkarchitectures to find optimal auctions.
Edit intent: fluency
Original:  While theoretical approaches to the problem have hit some limits, arecent research direction initiated by Duetting et al. (2019) consists in building neural networkarchitectures to find optimal auctions.
Revised:  While theoretical approaches to the problem have hit some limits, arecent research direction initiated by Duetting et al. (2019) consists in building neural network architectures to find optimal auctions.
Edit intent: fluency
Original:  We propose two conceptual deviations from their approachwhich result in enhanced performance.
Revised:  We propose two conceptual deviations from their approach which result in enhanced performance.
Edit intent: fluency
Original:  First, we use recent results in theoretical auctiondesign (Rubinstein and Weinberg, 2018) to introduce atime-independentLagrangian.
Revised:  First, we use recent results in theoretical auction design (Rubinstein and Weinberg, 2018) to introduce atime-independentLagrangian.
Edit intent: fluency
Original:  This notonly circumvents the need for an expensive hyper-parameter search (as in prior work), but alsoprovides a principled metric to compare the performance of two auctions (absent from priorwork ).
Revised:  This notonly circumvents the need for an expensive hyper-parameter search (as in prior work), but also provides a principled metric to compare the performance of two auctions (absent from priorwork ).
Edit intent: fluency
Original:  This notonly circumvents the need for an expensive hyper-parameter search (as in prior work), but alsoprovides a principled metric to compare the performance of two auctions (absent from priorwork ).
Revised:  This notonly circumvents the need for an expensive hyper-parameter search (as in prior work), but alsoprovides a principled metric to compare the performance of two auctions (absent from prior work ).
Edit intent: fluency
Original:  Second, the optimization procedure in previous work uses an inner maximization loop tocompute optimal misreports.
Revised:  Second, the optimization procedure in previous work uses an inner maximization loop to compute optimal misreports.
Edit intent: fluency
Original:  We amortize this process through the introduction of an additionalneural network.
Revised:  We amortize this process through the introduction of an additional neural network.
Edit intent: fluency
Original:  We demonstrate the effectiveness of our approach by learning competitive orstrictly improved auctions compared to prior work.
Revised:  We demonstrate the effectiveness of our approach by learning competitive or strictly improved auctions compared to prior work.
Edit intent: fluency
Original:  Both results together further imply a novelformulation of Auction Design as a two-player game with stationary utility functions.
Revised:  Both results together further imply a novel formulation of Auction Design as a two-player game with stationary utility functions.
Edit intent: fluency
Original:  We give a deterministic polynomials time algorithm, which for almost given more than a half bits of f(t) for sufficiently many randomly chosen points t \in \mathbb Z_{p^k}^*, recovers f(X).
Revised:  We give a deterministic polynomial time algorithm, which for almost given more than a half bits of f(t) for sufficiently many randomly chosen points t \in \mathbb Z_{p^k}^*, recovers f(X).
Edit intent: fluency
Original:  We also present results demonstrating the approach working with a second different underlying descriptor type , and two other beneficial properties of Delta Descriptors in comparison to existing techniques: their increased inherent robustness to variations in camera motion and a reduced rate of performance degradation as dimensional reduction is applied.
Revised:  We also present results demonstrating the approach working with a second different underlying descriptor types , and two other beneficial properties of Delta Descriptors in comparison to existing techniques: their increased inherent robustness to variations in camera motion and a reduced rate of performance degradation as dimensional reduction is applied.
Edit intent: fluency
Original: Retailers and major consumers of electricity generally purchase a critical percentage of their estimated electricity needs years ahead on the forward markets .
Revised: Retailers and major consumers of electricity generally purchase an important percentage of their estimated electricity needs years ahead on the forward markets .
Edit intent: clarity
Original: Retailers and major consumers of electricity generally purchase a critical percentage of their estimated electricity needs years ahead on the forward markets .
Revised: Retailers and major consumers of electricity generally purchase a critical percentage of their estimated electricity needs years ahead in the forward market .
Edit intent: clarity
Original:  On average, the proposed approach surpasses benchmark procurement strategies and achieves a reduction in costs of 1.65 \% \\%DIF > with respect to the perfectly uniform reference procurement strategy achieving the mean electricity price.
Revised:  On average, the proposed approach surpasses the benchmark procurement policies considered and achieves a reduction in costs of 1.65 \% \\%DIF > with respect to the perfectly uniform reference procurement strategy achieving the mean electricity price.
Edit intent: clarity
Original:  On average, the proposed approach surpasses benchmark procurement strategies and achieves a reduction in costs of 1.65 \% \\%DIF > with respect to the perfectly uniform reference procurement strategy achieving the mean electricity price.
Revised:  On average, the proposed approach surpasses benchmark procurement strategies and achieves a reduction in costs of 1.65 \\%DIF > with respect to the perfectly uniform reference procurement strategy achieving the mean electricity price.
Edit intent: fluency
Original:  On average, the proposed approach surpasses benchmark procurement strategies and achieves a reduction in costs of 1.65 \% \\%DIF > with respect to the perfectly uniform reference procurement strategy achieving the mean electricity price.
Revised:  On average, the proposed approach surpasses benchmark procurement strategies and achieves a reduction in costs of 1.65 \% \\%DIF > with respect to the perfectly uniform reference procurement policy achieving the mean electricity price.
Edit intent: clarity
Original:  Moreover, in addition to automating the  electricity procurement task, this algorithm demonstrates more consistent results throughout the years compared to the benchmark strategies .
Revised:  Moreover, in addition to automating the complex electricity procurement task, this algorithm demonstrates more consistent results throughout the years compared to the benchmark strategies .
Edit intent: clarity
Original:  Moreover, in addition to automating the complex electricity procurement task, this algorithm demonstrates more consistent results throughout the years compared to the benchmark policies .
Revised:  Moreover, in addition to automating the complex electricity procurement task, this algorithm demonstrates more consistent results throughout the years .
Edit intent: clarity
Original: This paperpresents the details of the DCASE 2020 Challenge Task 2 ;
Revised: In this paper, we present the task description and discuss the results of the DCASE 2020 Challenge Task 2 ;
Edit intent: clarity
Original: This paperpresents the details of the DCASE 2020 Challenge Task 2 ;
Revised: This paperpresents the details of the DCASE 2020 Challenge Task 2 :
Edit intent: fluency
Original:  We have designed a DCASE challenge task which contributes as a starting point and a benchmark of ASD research ;
Revised:  We have designed this challenge as the first benchmark of ASD research ;
Edit intent: clarity
Original:  the dataset, evaluation metrics,  a simple baseline system , and other detailed rules.
Revised:  the dataset, evaluation metrics, and a simple baseline system , and other detailed rules.
Edit intent: fluency
Original:  Also Google and Apple have announced their joint effort of providing an API for exposure notification in order to implement decentralized contract tracing apps using Bluetooth Low Energy, the so-called "Google/Apple Proposal", which we abbreviate by "GAP".
Revised:  Also Google and Apple have jointly provided an API for exposure notification in order to implement decentralized contract tracing apps using Bluetooth Low Energy, the so-called "Google/Apple Proposal", which we abbreviate by "GAP".
Edit intent: clarity
Original:  We demonstrate that in real-world scenarios the current GAP design is vulnerable to (i) profiling and possibly de-anonymizing infected persons, and (ii) relay-based wormhole attacks that principally can generate fake contacts with the potential of significantly affecting the accuracy of an app-based contact tracing system.
Revised:  We demonstrate that in real-world scenarios the current GAP design is vulnerable to (i) profiling and possibly de-anonymizing infected persons, and (ii) relay-based wormhole attacks that basically can generate fake contacts with the potential of significantly affecting the accuracy of an app-based contact tracing system.
Edit intent: coherence
Original:  We demonstrate that in real-world scenarios the current GAP design is vulnerable to (i) profiling and possibly de-anonymizing infected persons, and (ii) relay-based wormhole attacks that principally can generate fake contacts with the potential of significantly affecting the accuracy of an app-based contact tracing system.
Revised:  We demonstrate that in real-world scenarios the current GAP design is vulnerable to (i) profiling and possibly de-anonymizing infected persons, and (ii) relay-based wormhole attacks that principally can generate fake contacts with the potential of affecting the accuracy of an app-based contact tracing system.
Edit intent: clarity
Original:  For both types of attack, we have built tools that can be easily used on mobile phones or Raspberry Pis (e.g., Bluetooth sniffers).
Revised:  For both types of attack, we have built tools that can easily be used on mobile phones or Raspberry Pis (e.g., Bluetooth sniffers).
Edit intent: fluency
Original:   We hope that our findings provide valuable input in the process of testing and certifying contact tracing apps, e.g., as planned for the German Corona-Warn-App, ultimately guiding improvements for secure and privacy-preserving design and implementation of digital contact tracing systems.
Revised:  We hope that our findings provide valuable input for developing secure and privacy-preserving design and implementation of digital contact tracing systems.
Edit intent: clarity
Original:   We hope that our findings provide valuable input in the process of testing and certifying contact tracing apps, e.g., as planned for the German Corona-Warn-App, ultimately guiding improvements for secure and privacy-preserving design and implementation of digital contact tracing systems.
Revised:  We hope that our findings provide valuable input in the process of testing and certifying contact tracing apps, e.g., as planned for the German Corona-Warn-App, ultimately guiding improvements for secure and privacy-preserving digital contact tracing systems.
Edit intent: clarity
Original:  We also show how we distinguish a user who tested positive for COVID-19 and has a cough from a healthy user with  cough, and users who tested positive for COVID-19 and have a cough from users with asthma and a cough.
Revised:  We also show how we distinguish a user who tested positive for COVID-19 and has a cough from a healthy user with a cough, and users who tested positive for COVID-19 and have a cough from users with asthma and a cough.
Edit intent: fluency
Original:  Clearly these results are preliminary and only scratch the surface of the possibilities of the exploitation of this type of data and audio-based machine learning.
Revised:  These results are preliminary and only scratch the surface of the possibilities of the exploitation of this type of data and audio-based machine learning.
Edit intent: coherence
Original:  Clearly these results are preliminary and only scratch the surface of the possibilities of the exploitation of this type of data and audio-based machine learning.
Revised:  Clearly these results are preliminary and only scratch the surface of the potential of this type of data and audio-based machine learning.
Edit intent: clarity
Original: The late-time relaxation dynamics is analyzed for a general contagion model.
Revised: We analyze the late-time relaxation dynamics is analyzed for a general contagion model.
Edit intent: clarity
Original: The late-time relaxation dynamics is analyzed for a general contagion model.
Revised: The late-time relaxation dynamics for a general contagion model.
Edit intent: clarity
Original:  Active nodes can fail either ``spontaneously'' at any time or ``externally'' if their neighborhoods are sufficiently damaged.
Revised:  Active nodes can fail either "spontaneously" at any time or ``externally'' if their neighborhoods are sufficiently damaged.
Edit intent: fluency
Original:  Active nodes can fail either ``spontaneously'' at any time or ``externally'' if their neighborhoods are sufficiently damaged.
Revised:  Active nodes can fail either ``spontaneously'' at any time or "externally" if their neighborhoods are sufficiently damaged.
Edit intent: fluency
Original:  Indeed, we observe that time-translational invariance is lost for initial conditions that lie between the basins of attraction of the model's two stable stationary states.
Revised:  We observe that time-translational invariance is lost for initial conditions that lie between the basins of attraction of the model's two stable stationary states.
Edit intent: coherence
Original:  Our results provide new insights into aging and relaxation phenomena that are observable in a model of general contagion processes.
Revised:  Our results provide new insights into aging and relaxation phenomena that are observable in a model of social contagion processes.
Edit intent: clarity
Original: Controller area networks (CANs ) are a broadcast protocol for real-time communication of critical vehicle subsystems.
Revised: CANs are a broadcast protocol for real-time communication of critical vehicle subsystems.
Edit intent: clarity
Original:  Manufacturers of passenger vehicles hold secret their mappings of CAN data to vehicle signals, and these definitions vary per make, model, and year.
Revised:  Original equipment manufacturers of passenger vehicles hold secret their mappings of CAN data to vehicle signals, and these definitions vary per make, model, and year.
Edit intent: clarity
Original:  Manufacturers of passenger vehicles hold secret their mappings of CAN data to vehicle signals, and these definitions vary per make, model, and year.
Revised:  Manufacturers of passenger vehicles hold secret their mappings of CAN data to vehicle signals, and these definitions vary according to make, model, and year.
Edit intent: clarity
Original:  the wealth of real-time vehicle information hidden in  CAN packets is uninterpretable-- severely impeding vehicle-related research including CAN cybersecurity,
Revised:  the wealth of real-time vehicle information hidden in the CAN packets is uninterpretable-- severely impeding vehicle-related research including CAN cybersecurity,
Edit intent: fluency
Original:  the wealth of real-time vehicle information hidden in  CAN packets is uninterpretable-- severely impeding vehicle-related research including CAN cybersecurity,
Revised:  the wealth of real-time vehicle information hidden in CAN packets is uninterpretable, impeding vehicle-related research including CAN cybersecurity,
Edit intent: clarity
Original:  All previous methods ignore endianness and signedness, rendering them simply incapable of decoding many standard CAN signal definitions.
Revised:  Previous methods ignore endianness and signedness, rendering them simply incapable of decoding many standard CAN signal definitions.
Edit intent: coherence
Original:  All previous methods ignore endianness and signedness, rendering them simply incapable of decoding many standard CAN signal definitions.
Revised:  All previous methods ignore endianness and signedness, rendering them incapable of decoding many standard CAN signal definitions.
Edit intent: clarity
Original:  CAN-D is the only solution with the potential to extract any CAN signal and is the state of the art .
Revised:  CAN-D is the only solution with the potential to extract any CAN signal .
Edit intent: coherence
Original:  In evaluation on ten vehiclesof different makes , CAN-D's average \ell^1 error is 5 times better than all preceding methods and exhibits lower average error even when considering only signals that meet prior methods' assumptions.
Revised:  In evaluation on 10 vehicles , CAN-D's average \ell^1 error is 5 times better than all preceding methods and exhibits lower average error even when considering only signals that meet prior methods' assumptions.
Edit intent: clarity
Original:  In evaluation on ten vehiclesof different makes , CAN-D's average \ell^1 error is 5 times better than all preceding methods and exhibits lower average error even when considering only signals that meet prior methods' assumptions.
Revised:  In evaluation on ten vehiclesof different makes , CAN-D's average \ell^1 error is 5x better than all preceding methods and exhibits lower average error even when considering only signals that meet prior methods' assumptions.
Edit intent: fluency
Original:  In evaluation on ten vehiclesof different makes , CAN-D's average \ell^1 error is 5 times better than all preceding methods and exhibits lower average error even when considering only signals that meet prior methods' assumptions.
Revised:  In evaluation on ten vehiclesof different makes , CAN-D's average \ell^1 error is 5 times better than all previous methods and exhibits lower average error even when considering only signals that meet prior methods' assumptions.
Edit intent: fluency
Original:  In evaluation on ten vehiclesof different makes , CAN-D's average \ell^1 error is 5 times better than all preceding methods and exhibits lower average error even when considering only signals that meet prior methods' assumptions.
Revised:  In evaluation on ten vehiclesof different makes , CAN-D's average \ell^1 error is 5 times better than all preceding methods and exhibits lower ave. error, even when considering only signals that meet prior methods' assumptions.
Edit intent: clarity
Original:  Finally, CAN-D is implemented in lightweight hardware allowing OBD-II plugin for real-time in-vehicle CAN decoding.
Revised:  CAN-D is implemented in lightweight hardware allowing OBD-II plugin for real-time in-vehicle CAN decoding.
Edit intent: coherence
Original:  Finally, CAN-D is implemented in lightweight hardware allowing OBD-II plugin for real-time in-vehicle CAN decoding.
Revised:  Finally, CAN-D is implemented in lightweight hardware , allowing for an OBD-II plugin for real-time in-vehicle CAN decoding.
Edit intent: fluency
Original:  Since that time the model of microlending has received a fair amount of academic attention.
Revised:  Since that time the modeling of microlending has received a fair amount of academic attention.
Edit intent: fluency
Original:  One of the issues not yet addressed in  detail, however, is the issue of the size of the group.
Revised:  One of the issues not yet addressed in full detail, however, is the issue of the size of the group.
Edit intent: clarity
Original:  ( Some attention has nevertheless been paid , see the appropriate references in this paper.)
Revised:  Some attention has nevertheless been paid , see the appropriate references in this paper.)
Edit intent: fluency
Original:  Instead of a game theory approach , we take a mathematical approach to the issue of an optimal group size, where the goal is to minimize the probability of default of the group.
Revised:  Instead of a game theory approach . We, instead, take a mathematical approach to the issue of an optimal group size, where the goal is to minimize the probability of default of the group.
Edit intent: coherence
Original:  (In previous work we have addressed the issue of what is a fair rate of interest to charge for such a loan.)
Edit intent: clarity
Original: Ability to solve large sparse linear systems of equations is very important in modern numerical methods.
Revised: The efficient solution of large sparse saddle point systems is very important in modern numerical methods.
Edit intent: clarity
Original:  We describe the C++ programming techniques that can help in creating flexible and extensible programming interfaces for linear solvers .
Revised:  We describe the C++ programming techniques that may help to accelerate linear solvers for such problems .
Edit intent: clarity
Original:  The approach is based on  policy-based design  and partial template specialization, and is implemented in the open source AMGCL library.
Revised:  The approach is based on the policy-based design and partial template specialization, and is implemented in the open source AMGCL library.
Edit intent: fluency
Original:  Convenience for the user and efficiency is demonstrated on the example of accelerating a large-scale Stokes problemsolution with a Schur pressure correction preconditioner.
Revised:  The efficiency is demonstrated on the example of accelerating a large-scale Stokes problemsolution with a Schur pressure correction preconditioner.
Edit intent: coherence
Original:  Convenience for the user and efficiency is demonstrated on the example of accelerating a large-scale Stokes problemsolution with a Schur pressure correction preconditioner.
Revised:  Convenience for the user and efficiency is demonstrated with the example of accelerating a large-scale Stokes problemsolution with a Schur pressure correction preconditioner.
Edit intent: clarity
Original:  The user may select algorithmic components of the solver by adjusting template parameters without any change to the codebase.
Revised:  The user may select algorithmic components of the solver by adjusting template parameters without any changes to the codebase.
Edit intent: fluency
Original:  It is also possible to switch to block values, or use  mixed precision solution, which results in up to 4 times speedup, and reduces the memory footprint of the algorithm by about 50\%\\%DIF > . We evaluate both monolithic and composite  .
Revised:  It is possible to switch to block values, or use mixed precision solution, which results in up to 4 times speedup, and reduces the memory footprint of the algorithm by about 50\%\\%DIF > . We evaluate both monolithic and composite .
Edit intent: coherence
Original:  It is also possible to switch to block values, or use  mixed precision solution, which results in up to 4 times speedup, and reduces the memory footprint of the algorithm by about 50\%\\%DIF > . We evaluate both monolithic and composite  .
Revised:  It is also possible to switch to block values, or use a mixed precision solution, which results in up to 4 times speedup, and reduces the memory footprint of the algorithm by about 50\%\\%DIF > . We evaluate both monolithic and composite .
Edit intent: fluency