wanyu/IteraTeR_v2 huggingface dataset:
Original:  First, we formulate the connection pruning and the weight quantization as a supervised learning-based constrained optimization problem.
Revised:  First, we formulate the connection pruning and weight quantization as a supervised learning-based constrained optimization problem.
Edit intent: fluency
Original:  First, we formulate the connection pruning and the weight quantization as a supervised learning-based constrained optimization problem.
Revised:  First, we formulate the connection pruning and the weight quantization as a constrained optimization problem.
Edit intent: clarity
Original:  Second, we combine the emerging spatio-temporal backpropagation and the powerful alternating direction method of multipliers  to solve the problem with minimum accuracy loss.
Revised:  Second, we combine spatio-temporal backpropagation and the powerful alternating direction method of multipliers to solve the problem with minimum accuracy loss.
Edit intent: clarity
Original:  Third, we further propose an activity regularization to reduce the spike events for fewer active operations.
Revised:  Third, we further propose activity regularization to reduce the spike events for fewer active operations.
Edit intent: fluency
Original:   We define several quantitative metrics to evaluation the compression performance for SNNs and validate our methodology in pattern recognition tasks over MNIST, N-MNIST, and CIFAR10 datasets.
Revised:  We define several quantitative metrics to evaluation the compression performance for SNNs . Our methodology is validated in pattern recognition tasks over MNIST, N-MNIST, and CIFAR10 datasets.
Edit intent: clarity
Original:   We define several quantitative metrics to evaluation the compression performance for SNNs and validate our methodology in pattern recognition tasks over MNIST, N-MNIST, and CIFAR10 datasets.
Revised:  We define several quantitative metrics to evaluation the compression performance for SNNs and validate our methodology in pattern recognition tasks over MNIST, N-MNIST, CIFAR10 datasets.
Edit intent: fluency
Original:  To our best knowledge, this is the first work that studies SNN compression in a comprehensive manner by exploiting all possible compression ways and achieves better results .
Revised:  To our best knowledge, this is the first work that studies SNN compression in a comprehensive manner by exploiting all compressible components and achieves better results .
Edit intent: clarity
Original:  Several such BFT protocols follow a primary-backup design, in which a primary replica coordinates the consensus protocol.
Revised:  Several such BFT protocols follow a primary-backup replica coordinates the consensus protocol.
Edit intent: clarity
Original: Since the introduction of blockchains, several new database systems and applications have tried to employ them .
Revised: Several recent transaction processing applications provide resilience using blockchain technology .
Edit intent: clarity
Original:  At the core of such blockchain designs are Byzantine Fault-Tolerant  (BFT) consensus protocols that enable designing systems that are resilient to failures and malicious behavior.
Revised:  At the core of such resilient blockchain designs is Byzantine Fault-Tolerant (BFT) consensus protocols that enable designing systems that are resilient to failures and malicious behavior.
Edit intent: clarity
Original:  At the core of such blockchain designs are Byzantine Fault-Tolerant  (BFT) consensus protocols that enable designing systems that are resilient to failures and malicious behavior.
Revised:  At the core of such blockchain designs are Byzantine Fault-Tolerant (BFT) , which enables operations during failures and malicious behavior.
Edit intent: clarity
Original:  Unfortunately, existing BFT protocols seem unsuitable for usage in database systems due to their high computational costs, high communication costs, high client latencies, and/or reliance on trusted components and clients.
Revised:  Unfortunately, existing BFT protocols seem unsuitable for high-throughput applications due to their high computational costs, high communication costs, high client latencies, and/or reliance on trusted components and clients.
Edit intent: clarity
Original:  Unfortunately, existing BFT protocols seem unsuitable for usage in database systems due to their high computational costs, high communication costs, high client latencies, and/or reliance on trusted components and clients.
Revised:  Unfortunately, existing BFT protocols seem unsuitable for usage in database systems due to their high computational costs, high communication costs, high client latencies, and/or reliance on twin-paths and clients.
Edit intent: clarity
Original:  In this paper, we present the Proof-of-Execution consensus protocol ( PoE ) that alleviates these challenges.
Revised:  In this paper, we present the Proof-of-Execution consensus protocol ( POE ) that alleviates these challenges.
Edit intent: fluency
Original:  At the core of PoE are out-of-order processing and speculative execution, which allow PoE to execute transactions before consensus is reached among the replicas.
Revised:  At the core of POE are out-of-order processing and speculative execution, which allow PoE to execute transactions before consensus is reached among the replicas.
Edit intent: fluency
Original:  At the core of PoE are out-of-order processing and speculative execution, which allow PoE to execute transactions before consensus is reached among the replicas.
Revised:  At the core of PoE are out-of-order processing and speculative execution, which allow POE to execute transactions before consensus is reached among the replicas.
Edit intent: fluency
Original:  With these techniques, PoE manages to reduce the costs of BFT in normal cases, while still providing reliable consensus toward clients in all cases.
Revised:  With these techniques, POE manages to reduce the costs of BFT in normal cases, while still providing reliable consensus toward clients in all cases.
Edit intent: fluency
Original:  With these techniques, PoE manages to reduce the costs of BFT in normal cases, while still providing reliable consensus toward clients in all cases.
Revised:  With these techniques, PoE manages to reduce the costs of BFT in normal cases, while guaranteeing reliable consensus for clients in all cases.
Edit intent: clarity
Original:  We envision the use of PoE in high-performance resilient database systems.
Revised:  We envision the use of POE in high-throughput blockchain systems.
Edit intent: clarity
Original:  To validate this vision, we implement PoE in our efficient ResilientDB blockchain and database framework.
Revised:  To validate this vision, we implement POE in our efficient ResilientDB blockchain and database framework.
Edit intent: fluency
Original:  Our evaluation shows that PoE achieves up to 86%DIFDELCMD < \\%%% %DIF < more throughput than existing BFT protocols.
Revised:  Our evaluation shows that POE achieves up to 86%DIFDELCMD < \\%%% %DIF < more throughput than existing BFT protocols.
Edit intent: fluency
Original:  Unfortunately, existing BFT protocols seem unsuitable for high-throughput applications due to their high computational costs, high communication costs, high client latencies, and/or reliance on twin-paths and  clients.
Revised:  Unfortunately, existing BFT protocols are unsuitable for high-throughput applications due to their high computational costs, high communication costs, high client latencies, and/or reliance on twin-paths and clients.
Edit intent: clarity
Original:  In this paper, we present the Proof-of-Execution consensus protocol ( POE ) that alleviates these challenges.
Revised:  In this paper, we present the Proof-of-Execution consensus protocol ( PoE ) that alleviates these challenges.
Edit intent: fluency
Original:  At the core of POE are out-of-order processing and speculative execution, which allow POE to execute transactions before consensus is reached among the replicas.
Revised:  At the core of PoE are out-of-order processing and speculative execution, which allow POE to execute transactions before consensus is reached among the replicas.
Edit intent: fluency
Original:  At the core of POE are out-of-order processing and speculative execution, which allow POE to execute transactions before consensus is reached among the replicas.
Revised:  At the core of POE are out-of-order processing and speculative execution, which allow PoE to execute transactions before consensus is reached among the replicas.
Edit intent: fluency
Original:  With these techniques, POE manages to reduce the costs of BFT in normal cases, while guaranteeing reliable consensus for clients in all cases.
Revised:  With these techniques, PoE manages to reduce the costs of BFT in normal cases, while guaranteeing reliable consensus for clients in all cases.
Edit intent: fluency
Original:  We envision the use of POE in high-throughput  blockchain systems.
Revised:  We envision the use of PoE in high-throughput blockchain systems.
Edit intent: fluency
Original:  To validate this vision, we implement POE in our efficient RESILIENTDB blockchain fabric and extensively evaluate POE against several state-of-the-art BFT protocols.
Revised:  To validate this vision, we implement PoE in our efficient RESILIENTDB blockchain fabric and extensively evaluate POE against several state-of-the-art BFT protocols.
Edit intent: fluency
Original:  To validate this vision, we implement POE in our efficient RESILIENTDB blockchain fabric and extensively evaluate POE against several state-of-the-art BFT protocols.
Revised:  To validate this vision, we implement POE in our efficient ResilientDB fabric and extensively evaluate POE against several state-of-the-art BFT protocols.
Edit intent: clarity
Original:  To validate this vision, we implement POE in our efficient RESILIENTDB blockchain fabric and extensively evaluate POE against several state-of-the-art BFT protocols.
Revised:  To validate this vision, we implement POE in our efficient RESILIENTDB blockchain fabric and extensively evaluate PoE against several state-of-the-art BFT protocols.
Edit intent: fluency
Original:  Our evaluation shows that POE achieves up to 80\% more throughput than existing BFT protocols  .
Revised:  Our evaluation showcases that PoE achieves up-to-80\% higher throughputs than existing BFT protocols .
Edit intent: clarity
Original: Participatory budgeting (PB) is a democratic paradigm whereby voters decide on which projects to fund  .
Revised: Participatory budgeting (PB) is a democratic paradigm whereby voters decide on a set of projects to fund .
Edit intent: clarity
Original:  We consider PB in which voters may be asymmetric, and they report ordinal preferences over projects  .
Revised:  We consider PB in a setting where voters report ordinal preferences over projects .
Edit intent: clarity
Original:  We propose proportional representation axioms for the setting and clarify how they fit into other preference aggregation settings  .
Revised:  We propose proportional representation axioms and clarify how they fit into other preference aggregation settings .
Edit intent: clarity
Original: We propose a generic categorical framework for learning unknown formal languages of various types (e.g. finite or infinite words, trees, weighted and nominal languages).
Revised: We propose a generic categorical framework for learning unknown formal languages of various types (e.g. finite or infinite words, weighted and nominal languages).
Edit intent: clarity
Original:  Using the concept of an automata presentation of T-algebras, we demonstrate that the task of learning a T-recognizable language can be reduced to learning an abstract form of automaton, which is achieved via a generalized version of Angluin's L* algorithm .
Revised:  Using the concept of anautomata presentation of T-algebras, we demonstrate that the task of learning a T-recognizable language can be reduced to learning an abstract form of automaton, which is achieved via a generalized version of Angluin's L* algorithm .
Edit intent: fluency
Original:  Using the concept of an automata presentation of T-algebras, we demonstrate that the task of learning a T-recognizable language can be reduced to learning an abstract form of automaton, which is achieved via a generalized version of Angluin's L* algorithm .
Revised:  Using the concept of an automata presentation of T-algebras, we demonstrate that the task of learning a T-recognizable language can be reduced to learning an abstract form of automaton, which is achieved via a generalized version of Angluin's L* .
Edit intent: clarity
Original:  we provide for a generic termination and complexity analysis based on a dedicated notion of finiteness.
Revised:  we provide for a termination and complexity analysis based on a dedicated notion of finiteness.
Edit intent: clarity
Original:  Our framework applies to structures like tree languages or omega-regular languages that were not within the scope of existing categorical accounts of automata learning.
Revised:  Our framework applies to structures like omega-regular languages that were not within the scope of existing categorical accounts of automata learning.
Edit intent: clarity
Original:  In addition, it yields new generic learning algorithms for several types of languages for which no such algorithms were previously known at all, including sorted languages, nominal languages with name binding, and cost functions.
Revised:  In addition, it yields new learning algorithms for several types of languages for which no such algorithms were previously known at all, including sorted languages, nominal languages with name binding, and cost functions.
Edit intent: clarity
Original: This paper presents a Brownian-approximation framework to optimize the quality of experience (QoE) for real-time video delivery in wireless networks.
Revised: This paper presents a Brownian-approximation framework to optimize the quality of experience (QoE) for real-time video streaming in wireless networks.
Edit intent: clarity
Original:  In real-time video delivery , one major challenge is to tackle the natural tension between the two most critical QoE metrics: playback latency and video playback interruption.
Revised:  In real-time video streaming , one major challenge is to tackle the natural tension between the two most critical QoE metrics: playback latency and video playback interruption.
Edit intent: clarity
Original:  In real-time video delivery , one major challenge is to tackle the natural tension between the two most critical QoE metrics: playback latency and video playback interruption.
Revised:  In real-time video delivery , one major challenge is to tackle the natural tension between the two most critical QoE metrics: playback latency and video interruption.
Edit intent: clarity
Original:  We propose a simple scheduling policy that satisfies any feasible set of QoE performance requirements and then demonstrate the wide applicability of the proposed policy in network utility maximization for QoE .
Revised:  We propose a scheduling policy that satisfies any feasible set of QoE performance requirements and then demonstrate the wide applicability of the proposed policy in network utility maximization for QoE .
Edit intent: clarity
Original:  It is shown , with several examples, that the Peregrine solution is unstable against all standard perturbations, and that some perturbations can even lead to a blow up .
Revised:  It is shown that the Peregrine solution is unstable against all standard perturbations, and that some perturbations can even lead to a blow up .
Edit intent: clarity
Original: Convergence with respect to imaginary-time discretization (i.e., the number of ring-polymer beads) is an essential part of any path-integral-based molecular dynamics (MD) calculation.
Revised: Convergence with respect to imaginary-time discretization is an essential part of any path-integral-based molecular dynamics (MD) calculation.
Edit intent: coherence
Original: Convergence with respect to imaginary-time discretization (i.e., the number of ring-polymer beads) is an essential part of any path-integral-based molecular dynamics (MD) calculation.
Revised: Convergence with respect to imaginary-time discretization (i.e., the number of ring-polymer beads) is an essential part of any path-integral-based calculation.
Edit intent: clarity
Original:  However, an unfortunate property of existing non-preconditioned numerical integration schemes for path-integral molecular dynamics (PIMD) - including essentially all existing ring-polymer molecular dynamics (RPMD) and thermostatted RPMD (T-RPMD) methods - is that for a given MD timestep, the overlap between the exact ring-polymer Boltzmann distribution and that sampled using MD becomes zero in the infinite-bead limit.
Revised:  However, an unfortunate property of existing non-preconditioned numerical integration schemes for path-integral molecular dynamics (PIMD) - including ring-polymer molecular dynamics (RPMD) and thermostatted RPMD (T-RPMD) methods - is that for a given MD timestep, the overlap between the exact ring-polymer Boltzmann distribution and that sampled using MD becomes zero in the infinite-bead limit.
Edit intent: clarity
Original:  However, an unfortunate property of existing non-preconditioned numerical integration schemes for path-integral molecular dynamics (PIMD) - including essentially all existing ring-polymer molecular dynamics (RPMD) and thermostatted RPMD (T-RPMD) methods - is that for a given MD timestep, the overlap between the exact ring-polymer Boltzmann distribution and that sampled using MD becomes zero in the infinite-bead limit.
Revised:  However, an unfortunate property of existing non-preconditioned numerical integration schemes for path-integral molecular dynamics (PIMD) - including essentially all existing ring-polymer molecular dynamics (RPMD) and thermostatted RPMD (T-RPMD) - is that for a given MD timestep, the overlap between the exact ring-polymer Boltzmann distribution and that sampled using MD becomes zero in the infinite-bead limit.
Edit intent: clarity
Original:  This has clear implications for hybrid Metropolis Monte-Carlo/MD sampling schemes , and it also causes the well-known divergence with bead number of the primitive path-integral kinetic-energy expectation value when using standard RPMD or T-RPMD . We show that these problems can be avoided through the introduction of "dimension-free" numerical integration schemes for which the sampled ring-polymer  distribution has non-zero overlap with the exact distribution in the infinite-bead limit .
Revised:  This has clear implications for hybrid Metropolis Monte-Carlo/MD sampling schemes . We show that these problems can be avoided through the introduction of "dimension-free" numerical integration schemes for which the sampled ring-polymer distribution has non-zero overlap with the exact distribution in the infinite-bead limit .
Edit intent: coherence
Original:  Moreover, we show that this can be achieved by using a (previously introduced) strongly stable method for the free-ring-polymer evolution in combination with a (newly introduced) mollification of the forces from the external physical potential .
Revised:  Moreover, we show that this can be achieved via mollification of the forces from the external physical potential .
Edit intent: coherence
Original:  The resulting dimension-free numerical integration schemes yield finite error bounds for a given MD timestep , even as the number of beads is taken to infinity;
Revised:  The resulting dimension-free numerical integration schemes yield finite error bounds for a given MD timestep as the number of beads is taken to infinity;
Edit intent: coherence
Original:  these conclusions are proven for the case of a harmonic potential and borne out numerically for anharmonic cases.
Revised:  these conclusions are proven for harmonic potential and borne out numerically for anharmonic cases.
Edit intent: clarity
Original:  Importantly, dimension-free RPMD achieves these benefits while preserving strong stability, symplecticity, time reversibility, and global second-order accuracy;
Revised:  Importantly, dimension-free , non-preconditioned integration schemes introduced here preserve strong stability, symplecticity, time reversibility, and global second-order accuracy;
Edit intent: clarity
Original:  and it remains a simple, black-box method by avoiding computational costs, tunable parameters, or system-specific implementations.
Revised:  and they remain simple, black-box method by avoiding computational costs, tunable parameters, or system-specific implementations.
Edit intent: fluency
Original:  and it remains a simple, black-box method by avoiding computational costs, tunable parameters, or system-specific implementations.
Revised:  and it remains a simple, black-box methods that avoid additional computational costs, tunable parameters, or system-specific implementations.
Edit intent: clarity
Original:  Importantly, the dimension-free, non-preconditioned integration schemes introduced here preserve strong stability, symplecticity, time reversibility, and global second-order accuracy ;
Revised:  Importantly, the dimension-free, non-preconditioned integration schemes introduced here preserve ergodicity and global second-order accuracy ;
Edit intent: clarity
Original:  Importantly, the dimension-free, non-preconditioned integration schemes introduced here preserve strong stability, symplecticity, time reversibility, and global second-order accuracy ;
Revised:  Importantly, the dimension-free, non-preconditioned integration schemes introduced here preserve strong stability, symplecticity, time reversibility, and global second-order accuracy ,
Edit intent: fluency
Original: We review a numerical technique, referred to as the Transport-based Meshfree Method (TMM), and we discuss its applications to mathematical finance.
Revised: We review a numerical technique, referred to as the Transport-based Mesh-free Method (TMM), and we discuss its applications to mathematical finance.
Edit intent: fluency
Original:  If this is the case, then the dual tensor operation corresponds, via Raney's transforms, to composition in the (dual) quantale of meet-continuous endo-functions of L. Let Latt be the category of sup-lattices and join-continuous functions and let Latt cd be the full subcategory of Latt whose objects are the completely distributive lattices.
Revised:  If this is the case, then the dual tensor operation corresponds, via Raney's transforms, to composition in the (dual) quantale of meet-continuous endo-functions of L. Let Latt be the category of sup-lattices and join-continuous functions and let cdLatt be the full subcategory of Latt whose objects are the completely distributive lattices.
Edit intent: clarity
Original:  If this is the case, then the dual tensor operation corresponds, via Raney's transforms, to composition in the (dual) quantale of meet-continuous endo-functions of L. Let Latt be the category of sup-lattices and join-continuous functions and let Latt cd be the full subcategory of Latt whose objects are the completely distributive lattices.
Revised:  If this is the case, then the dual tensor operation corresponds, via Raney's transforms, to composition in the (dual) quantale of meet-continuous endo-functions of L. Let Latt be the category of sup-lattices and join-continuous functions and let Latt cd be the full subcategory of sLatt whose objects are the completely distributive lattices.
Edit intent: clarity
Original:  (ii) Latt cd is closed under the monoidal operations of Latt , andtherefore it is star-autonomous.
Revised:  (ii) cdLatt is closed under the monoidal operations of Latt , andtherefore it is star-autonomous.
Edit intent: clarity
Original:  Consequently, if Q(L) is involutive, then it is completely distributive as well.
Revised:  Consequently, if Q(L) is involutive, then Q(L) is completely distributive as well.
Edit intent: clarity