wanyu/IteraTeR_v2 huggingface dataset:
Original:  When the input is generic, involves s polynomials of degree bounded by D with n quantified variables and t unquantified ones, we prove that this algorithm outputs semi-algebraic formulas of degree bounded by D using O \ {\widetilde{~ \left ( n \ 8^{t}\ D^{3t+2} \ t+\mathcal{D}{t} \right ) arithmetic operations in the ground field where D = n \ D^s(D-1)^{n-s+1}\ n{s}.
Revised:  When the input is generic, involves s polynomials of degree bounded by D with n quantified variables and t unquantified ones, we prove that this algorithm outputs semi-algebraic formulas of degree bounded by D using O \ {\widetilde{~ \left ( (n-s+1) \ 8^{t}\ D^{3t+2} \ t+\mathcal{D}{t} \right ) arithmetic operations in the ground field where D = n \ D^s(D-1)^{n-s+1}\ n{s}.
Edit intent: fluency
Original:  When the input is generic, involves s polynomials of degree bounded by D with n quantified variables and t unquantified ones, we prove that this algorithm outputs semi-algebraic formulas of degree bounded by D using O \ {\widetilde{~ \left ( n \ 8^{t}\ D^{3t+2} \ t+\mathcal{D}{t} \right ) arithmetic operations in the ground field where D = n \ D^s(D-1)^{n-s+1}\ n{s}.
Revised:  When the input is generic, involves s polynomials of degree bounded by D with n quantified variables and t unquantified ones, we prove that this algorithm outputs semi-algebraic formulas of degree bounded by D using O \ {\widetilde{~ \left ( n \ 8^{t}\ D^{3t+2} t+\mathcal{D}{t} \right ) arithmetic operations in the ground field where D = n \ D^s(D-1)^{n-s+1}\ n{s}.
Edit intent: fluency
Original:  In this paper, we  propose a novel compressed gradient tracking algorithm (C-GT) that combines gradient tracking technique with communication compression.
Revised:  In this paper, we first propose a novel compressed gradient tracking algorithm (C-GT) that combines gradient tracking technique with communication compression.
Edit intent: coherence
Original:   We show that C-GT inherits the advantages of gradient tracking-based algorithms , and in particular, achieves linear convergence rate for strongly convex and smooth objective functions.
Revised:  We show that C-GT inherits the advantages of gradient tracking-based algorithms and achieves linear convergence rate for strongly convex and smooth objective functions.
Edit intent: coherence
Original:  Numerical examples further demonstrate the efficiency and flexibility of the proposed algorithm .
Revised:  Numerical examples further demonstrate the efficiency and flexibility of the proposed algorithms .
Edit intent: fluency
Original:  In this paper, we address multi-asset optimal execution in a model where prices have multivariate Ornstein-Uhlenbeck dynamics and where the agent maximizes the expected (exponential) utility of her P\&L . We use the tools of stochastic optimal control and simplify the initial multidimensional Hamilton-Jacobi-Bellman equation into a system of ordinary differential equations (ODEs) involving a Matrix Riccati ODE for which classical existence theorems do not apply.
Revised:  In this paper, we address multi-asset optimal execution in a model where prices have multivariate Ornstein-Uhlenbeck dynamics and where the agent maximizes the expected (exponential) utility of her PnL . We use the tools of stochastic optimal control and simplify the initial multidimensional Hamilton-Jacobi-Bellman equation into a system of ordinary differential equations (ODEs) involving a Matrix Riccati ODE for which classical existence theorems do not apply.
Edit intent: clarity
Original:  The main technical contributions include the construction of polynomially bounded non-zero circulation weights in single crossing minor free graphs based on existing results AGGT16,DKMTVZ20%DIFDELCMD < ]%%% ;
Revised:  The main technical contributions include the construction of polynomially bounded non-zero circulation weights in single crossing minor free graphs AGGT16,DKMTVZ20%DIFDELCMD < ]%%% ;
Edit intent: clarity
Original:  The main technical contributions include the construction of polynomially bounded non-zero circulation weights in single crossing minor free graphs based on existing results AGGT16,DKMTVZ20%DIFDELCMD < ]%%% ;
Revised:  The main technical contributions include the construction of polynomially bounded non-zero circulation weights in single crossing minor free graphs based on existing results %DIFDELCMD < ]%%% ;
Edit intent: clarity
Original:  using the approach from FGT16%DIFDELCMD < ] %%% to construct dynamic isolating weights and generalizing the rank algorithm from DKMSZ15,DKMSZ18%DIFDELCMD < ] %%% to handle slightly sublogarithmic many (O(log n/log log n)) changes .
Revised:  using the approach from %DIFDELCMD < ] %%% to construct dynamic isolating weights and generalizing the rank algorithm from DKMSZ15,DKMSZ18%DIFDELCMD < ] %%% to handle slightly sublogarithmic many (O(log n/log log n)) changes .
Edit intent: clarity
Original: We show that for each single crossing graph H, a polynomially bounded weight function for all H-minor free graphs G can be constructed in Logspace such that it gives nonzero weights to all the cycles in G. This class of graphs subsumes almost all classes of graphs for which such a weight function is know to be constructed in Logspace.
Revised: We show that for each single crossing graph H, a polynomially bounded weight function for all H-minor free graphs G can be constructed in Logspace such that it gives nonzero weights to all the cycles in G. This class of graphs subsumes almost all classes of graphs for which such a weight function is known to be constructed in Logspace.
Edit intent: fluency
Original:  Most prior methods model these two dimensions separately ;
Revised:  Most prior methods model these two dimensions separately ,
Edit intent: fluency
Original:  Our method significantly improves the state of the art on well-established pedestrian and autonomous driving datasets.
Revised:  Our method substantially improves the state of the art on well-established pedestrian and autonomous driving datasets.
Edit intent: clarity
Original:  The long context window of 1.5 seconds allows us to capture the low frequency temporal modulations of speech in the spectrogram.
Revised:  A long context window of 1.5 seconds allows us to capture the low frequency temporal modulations of speech in the spectrogram.
Edit intent: fluency
Original:  For an end-to-end automatic speech recognition task, the FDLP-spectrogram performs at-par with the standard mel-spectrogram features for clean read speech training and test data.
Revised:  For an end-to-end automatic speech recognition task, the FDLP spectrogram performs on par with the standard mel-spectrogram features for clean read speech training and test data.
Edit intent: fluency
Original:  For an end-to-end automatic speech recognition task, the FDLP-spectrogram performs at-par with the standard mel-spectrogram features for clean read speech training and test data.
Revised:  For an end-to-end automatic speech recognition task, the FDLP-spectrogram performs at-par with the standard mel spectrogram features for clean read speech training and test data.
Edit intent: fluency
Original:  For more realistic mismatched train-test situations and noisy, reverberated training data, the FDLP-spectrogram shows up to 25\% and 22\%  WER improvements over mel-spectrogram respectively.
Revised:  For more realistic speech data with train-test situations and noisy, reverberated training data, the FDLP-spectrogram shows up to 25\% and 22\% WER improvements over mel-spectrogram respectively.
Edit intent: clarity
Original:  For more realistic mismatched train-test situations and noisy, reverberated training data, the FDLP-spectrogram shows up to 25\% and 22\%  WER improvements over mel-spectrogram respectively.
Revised:  For more realistic mismatched train-test domain mismatches or reverberations, FDLP spectrogram shows up to 25\% and 22\% WER improvements over mel-spectrogram respectively.
Edit intent: clarity
Original:  For more realistic mismatched train-test situations and noisy, reverberated training data, the FDLP-spectrogram shows up to 25\% and 22\%  WER improvements over mel-spectrogram respectively.
Revised:  For more realistic mismatched train-test situations and noisy, reverberated training data, the FDLP-spectrogram shows up to 25\% and 22\% WER improvements over mel spectrogram respectively.
Edit intent: fluency
Original: In recent years, prominent blockchain systems such as Bitcoin and Ethereum have experienced explosive growth in transaction volume, leading to frequent surges in demand for limited block space , causing transaction fees to fluctuate by orders of magnitude.
Revised: In recent years, prominent blockchain systems such as Bitcoin and Ethereum have experienced explosive growth in transaction volume, leading to frequent surges in demand for limited block space and causing transaction fees to fluctuate by orders of magnitude.
Edit intent: coherence
Original:  Under the standard first-price auction approach , users find it difficult to estimate how much they need to bid  to get their transactions accepted (balancing the risk of delay with a preference to avoid paying more than is necessary) .
Revised:  Under the standard first-price auctions; however , users find it difficult to estimate how much they need to bid to get their transactions accepted (balancing the risk of delay with a preference to avoid paying more than is necessary) .
Edit intent: clarity
Original:  Under the standard first-price auction approach , users find it difficult to estimate how much they need to bid  to get their transactions accepted (balancing the risk of delay with a preference to avoid paying more than is necessary) .
Revised:  Under the standard first-price auction approach , users find it difficult to estimate how much they need to bid in order to get their transactions accepted (balancing the risk of delay with a preference to avoid paying more than is necessary) .
Edit intent: clarity
Original:  In light of these issues, new transaction fee mechanisms have been proposed, most notably EIP-1559 . A problem with EIP-1559 is that under market instability, it again reduces to a first-price auction.
Revised:  In light of these issues, new transaction fee mechanisms have been proposed, most notably EIP-1559 . A problem with EIP-1559 is a first-price auction.
Edit intent: coherence
Original:  This is the first work that generates an IR from a single image, which we call Image2Reverb.
Revised:  This work generates an IR from a single image, which we call Image2Reverb.
Edit intent: coherence
Original:  In this paper, inspired by Relativistic GAN \mbox{ jolicoeur2018relativistic , we introduce a novel variant of the LSGAN framework under the context of waveform synthesis, named Pointwise Relativistic LSGAN (PRLSGAN).
Revised:  In this paper, inspired by Relativistic GAN , we introduce a novel variant of the LSGAN framework under the context of waveform synthesis, named Pointwise Relativistic LSGAN (PRLSGAN).
Edit intent: coherence
Original: Novel numerical estimators are proposed for the forward-backward stochastic differential equations ( FBSDE ) appearing in the Feynman-Kac representation of the value function  .
Revised: Novel numerical estimators are proposed for solving forward-backward stochastic differential equations ( FBSDE ) appearing in the Feynman-Kac representation of the value function .
Edit intent: clarity
Original: Novel numerical estimators are proposed for the forward-backward stochastic differential equations ( FBSDE ) appearing in the Feynman-Kac representation of the value function  .
Revised: Novel numerical estimators are proposed for the forward-backward stochastic differential equations ( FBSDEs ) appearing in the Feynman-Kac representation of the value function .
Edit intent: clarity
Original:  In contrast to the current numerical method approaches based on discretization of the continuous-time FBSDE results , we propose a converse approach, by first obtaining a discrete-time approximation of the on-policy value function, and then developing a discrete-time result which resembles the continuous-time counterpart.
Revised:  In contrast to the current numerical approaches which are based on the discretization of the continuous-time FBSDE results , we propose a converse approach, by first obtaining a discrete-time approximation of the on-policy value function, and then developing a discrete-time result which resembles the continuous-time counterpart.
Edit intent: clarity
Original:  In contrast to the current numerical method approaches based on discretization of the continuous-time FBSDE results , we propose a converse approach, by first obtaining a discrete-time approximation of the on-policy value function, and then developing a discrete-time result which resembles the continuous-time counterpart.
Revised:  In contrast to the current numerical method approaches based on discretization of the continuous-time FBSDE , we propose a converse approach, by first obtaining a discrete-time approximation of the on-policy value function, and then developing a discrete-time result which resembles the continuous-time counterpart.
Edit intent: clarity
Original:  In contrast to the current numerical method approaches based on discretization of the continuous-time FBSDE results , we propose a converse approach, by first obtaining a discrete-time approximation of the on-policy value function, and then developing a discrete-time result which resembles the continuous-time counterpart.
Revised:  In contrast to the current numerical method approaches based on discretization of the continuous-time FBSDE results , we propose a converse approach, namely, we obtain a discrete-time approximation of the on-policy value function, and then developing a discrete-time result which resembles the continuous-time counterpart.
Edit intent: coherence
Original:  In contrast to the current numerical method approaches based on discretization of the continuous-time FBSDE results , we propose a converse approach, by first obtaining a discrete-time approximation of the on-policy value function, and then developing a discrete-time result which resembles the continuous-time counterpart.
Revised:  In contrast to the current numerical method approaches based on discretization of the continuous-time FBSDE results , we propose a converse approach, by first obtaining a discrete-time approximation of the on-policy value function, and then we derive a discrete-time result which resembles the continuous-time counterpart.
Edit intent: clarity
Original:  In contrast to the current numerical method approaches based on discretization of the continuous-time FBSDE results , we propose a converse approach, by first obtaining a discrete-time approximation of the on-policy value function, and then developing a discrete-time result which resembles the continuous-time counterpart.
Revised:  In contrast to the current numerical method approaches based on discretization of the continuous-time FBSDE results , we propose a converse approach, by first obtaining a discrete-time approximation of the on-policy value function, and then developing a discrete-time estimator that resembles the continuous-time counterpart.
Edit intent: clarity
Original:  This approach yields improved numerical estimators in the function approximation phase, and demonstrates enhanced error analysisfor those value function estimators.
Revised:  The proposed approach allows for the construction of higher accuracy estimators along with error analysis. The approach is applied to the policy improvement step in reinforcement learning.
Edit intent: coherence
Original:  However, most of the current neuromodulation implement pre-determined actuation strategies rather than closed-loop neurofeedback.
Revised:  However, most of the current neuromodulations implement pre-determined actuation strategies rather than closed-loop neurofeedback.
Edit intent: fluency
Original:  Our framework combines a deep Koopman-operator based model for seizure prediction in an approximated finite dimensional linear dynamics and the model predictive control (MPC) for designing optimal seizure suppression strategies.
Revised:  Our framework combines a deep Koopman-operator based model for seizure prediction in an approximated finite dimensional linear dynamics and model predictive control (MPC) for designing optimal seizure suppression strategies.
Edit intent: fluency
Original:  We validate our model with synthetic seizure data from  Jansen-Rit Model which generates neural dynamics in a single cortical column and two distant cortical columns.
Revised:  We validate our model with synthetic seizure data from the Jansen-Rit Model which generates neural dynamics in a single cortical column and two distant cortical columns.
Edit intent: fluency
Original:  Inspired by insights from prior-free auction design, we propose a mechanism, FIPFA (Federated Incentive Payments via Prior-Free Auctions), to collect monetary contributions from self-interested clients.
Revised:  Inspired by insights from prior-independent auction design, we propose a mechanism, FIPFA (Federated Incentive Payments via Prior-Free Auctions), to collect monetary contributions from self-interested clients.
Edit intent: clarity
Original:  Inspired by insights from prior-free auction design, we propose a mechanism, FIPFA (Federated Incentive Payments via Prior-Free Auctions), to collect monetary contributions from self-interested clients.
Revised:  Inspired by insights from prior-free auction design, we propose a mechanism, FIPFA (Federated Incentive Payments via Prior-Independent Auctions), to collect monetary contributions from self-interested clients.
Edit intent: clarity
Original:  We run experiments on the MNIST dataset to test clients' model quality under FIPFA and FIPFA 's incentive properties.
Revised:  We run experiments on the MNIST dataset to test clients' model quality under FIPIA and FIPIA 's incentive properties.
Edit intent: style
Original: Localization of low-cost unmanned aerial vehicles (UAVs) often relies on Global Navigation Satellite Systems (GNSS).
Revised: Localization of low-cost Unmanned Aerial Vehicles (UAVs) often relies on Global Navigation Satellite Systems (GNSS).
Edit intent: fluency
Original: The detection of polylines in images is usually either bound to branchless polylines or formulated in a recurrent way, prohibiting their use in real-time systems.
Revised: The detection of polylines is usually either bound to branchless polylines or formulated in a recurrent way, prohibiting their use in real-time systems.
Edit intent: clarity
Original:  We propose an approach that transfers the idea of single shot object detection.
Revised:  We propose an approach that builds upon the idea of single shot object detection.
Edit intent: clarity
Original:  Reformulating the problem of polyline detection as  bottom-up composition of small line segments allows to detect bounded, dashed and continuous polylines with a single head.
Revised:  Reformulating the problem of polyline detection as a bottom-up composition of small line segments allows to detect bounded, dashed and continuous polylines with a single head.
Edit intent: fluency
Original:  By predicting multiple line segments for each spatial cell, even branching or crossing polylines can be detected.
Revised:  By predicting multiple line segments for each cell, even branching or crossing polylines can be detected.
Edit intent: clarity
Original: Session types are used to specify and verify communication protocols and have been integrated in the \pi%DIFDELCMD < }%%% -calculus and a linear concurrent \lambda%DIFDELCMD < }%%% -calculus -- Good Variation (GV), among others.
Revised:  \pi%DIFDELCMD < }%%% -calculus and a linear concurrent \lambda%DIFDELCMD < }%%% -calculus -- Good Variation (GV), among others.
Edit intent: coherence
Original: Session types are used to specify and verify communication protocols and have been integrated in the \pi%DIFDELCMD < }%%% -calculus and a linear concurrent \lambda%DIFDELCMD < }%%% -calculus -- Good Variation (GV), among others.
Revised: Session types are used to specify and verify communication protocols and have been integrated in the %DIFDELCMD < }%%% -calculus and a linear concurrent \lambda%DIFDELCMD < }%%% -calculus -- Good Variation (GV), among others.
Edit intent: fluency
Original: Session types are used to specify and verify communication protocols and have been integrated in the \pi%DIFDELCMD < }%%% -calculus and a linear concurrent \lambda%DIFDELCMD < }%%% -calculus -- Good Variation (GV), among others.
Revised: Session types are used to specify and verify communication protocols and have been integrated in the \pi%DIFDELCMD < }%%% -calculus and a linear concurrent %DIFDELCMD < }%%% -calculus -- Good Variation (GV), among others.
Edit intent: fluency
Original:  Session type systems guarantee communication safety and session fidelity, but cannot guarantee deadlock freedom and avoid bad interleaving of different sessions.
Revised:  Session type systems guarantee communication safety and session fidelity, but alone they cannot rule out deadlocks arising from the interleaving of different sessions.
Edit intent: clarity
Original:  In Classical Processes (CP) , a process calculus based on classical linear logic, deadlock freedom is guaranteed by combining channel creation and parallel composition under the same logical cut rule.
Revised:  In Classical Processes (CP) -a process calculus based on classical linear logic, deadlock freedom is guaranteed by combining channel creation and parallel composition under the same logical cut rule.
Edit intent: fluency
Original:  In Classical Processes (CP) , a process calculus based on classical linear logic, deadlock freedom is guaranteed by combining channel creation and parallel composition under the same logical cut rule.
Revised:  In Classical Processes (CP) , a process calculus based on classical linear logic-deadlock freedom is guaranteed by combining channel creation and parallel composition under the same logical cut rule.
Edit intent: fluency
Original:  In both GV and CP , deadlock freedom is achieved at the expense of expressivity  as the only communication structures allowed are trees . Dardha and Gay define Priority CP (PCP), which allows for cyclic structures and restores deadlock freedom by adding prioritiesto types , in line with Kobayashi and Padovani 's work .
Revised:  In both CP and GV , deadlock freedom is achieved at the expense of expressivity as the only communication structures allowed are trees . Dardha and Gay define Priority CP (PCP), which allows for cyclic structures and restores deadlock freedom by adding prioritiesto types , in line with Kobayashi and Padovani 's work .
Edit intent: fluency
Original:  In both GV and CP , deadlock freedom is achieved at the expense of expressivity  as the only communication structures allowed are trees . Dardha and Gay define Priority CP (PCP), which allows for cyclic structures and restores deadlock freedom by adding prioritiesto types , in line with Kobayashi and Padovani 's work .
Revised:  In both GV and CP , deadlock freedom is achieved at the expense of expressivity , as the only communication structures allowed are trees . Dardha and Gay define Priority CP (PCP), which allows for cyclic structures and restores deadlock freedom by adding prioritiesto types , in line with Kobayashi and Padovani 's work .
Edit intent: fluency
Original:  In both GV and CP , deadlock freedom is achieved at the expense of expressivity  as the only communication structures allowed are trees . Dardha and Gay define Priority CP (PCP), which allows for cyclic structures and restores deadlock freedom by adding prioritiesto types , in line with Kobayashi and Padovani 's work .
Revised:  In both GV and CP , deadlock freedom is achieved at the expense of expressivity as the only processes allowed are tree-structured . Dardha and Gay define Priority CP (PCP), which allows for cyclic structures and restores deadlock freedom by adding prioritiesto types , in line with Kobayashi and Padovani 's work .
Edit intent: clarity