wanyu/IteraTeR_v2 huggingface dataset:
Original:  While the preferences of rankers can be inferred by interleaved comparison methods, how to effectively choose the pair of rankers to generate the result list without degrading the user experience too much can be formalized as a K-armed dueling bandit problem, which is an online partial-information learning framework, where feedback comes in the form of pair-wise preferences.
Revised:  While the preferences of rankers can be inferred by interleaved comparison methods, how to effectively choose the ranker pair that generates the interleaved list without degrading the user experience too much can be formalized as a K-armed dueling bandit problem, which is an online partial-information learning framework, where feedback comes in the form of pair-wise preferences.
Edit intent: clarity
Original:  While the preferences of rankers can be inferred by interleaved comparison methods, how to effectively choose the pair of rankers to generate the result list without degrading the user experience too much can be formalized as a K-armed dueling bandit problem, which is an online partial-information learning framework, where feedback comes in the form of pair-wise preferences.
Revised:  While the preferences of rankers can be inferred by interleaved comparison methods, how to effectively choose the pair of rankers to generate the result list without degrading the user experience too much can be formalized as a K-armed dueling bandit problem, which is a variant of the K-armed bandit problem, where the feedback comes in the form of pair-wise preferences.
Edit intent: clarity
Original:  We propose Merge Double Thompson Sampling (MergeDTS), which first utilizes a divide-and-conquer strategy that localizes the comparisons carried out by the algorithm to small batches of rankers, and then employs the Thompson Sampling (TS) to reduce the comparisons between suboptimal rankers inside these small batches.
Revised:  We propose Merge Double Thompson Sampling (MergeDTS), which first utilizes a divide-and-conquer strategy that localizes the comparisons carried out by the algorithm to small batches of rankers, and then employs Thompson Sampling (TS) to reduce the comparisons between suboptimal rankers inside these small batches.
Edit intent: coherence
Original:  Our main finding is that for large-scale Condorcet ranker evaluation problems  MergeDTS outperforms the state-of-the-art dueling bandit algorithms.
Revised:  Our main finding is that for large-scale Condorcet ranker evaluation problems , MergeDTS outperforms the state-of-the-art dueling bandit algorithms.
Edit intent: fluency
Original: It is well-known that every 2-connected planar graph has a Tutte path, i.e., a path P such that any component of G-P has only two or three attachment points on P.
Revised: It is well-known that every planar graph has a Tutte path, i.e., a path P such that any component of G-P has only two or three attachment points on P.
Edit intent: clarity
Original:  In this paper, we give a new proof that 2-connected planar graphs have Tutte paths which leads easily to a linear-time algorithm to find Tutte paths.
Revised:  In this paper, we give a new proof that 2-connected planar graphs have Tutte paths , which leads to a linear-time algorithm to find Tutte paths.
Edit intent: clarity
Original:  Furthermore, for 3-connected planar graphs our Tutte paths come with a system of distinct representatives, a strengthening that allows applications (such as finding 2-walks) to also be done in linear time  .
Revised:  Furthermore, for 3-connected planar graphs our Tutte paths come with a system of distinct representatives, a strengthening that allows applications (such as finding 2-walks) in linear time .
Edit intent: clarity
Original:  Here we present a probabilistic domain-specific language where BO is native, showing the Bayesian approach to optimization is more naturally expressed in a PPS, and better equipped to address the above issues.
Revised:  Here we present a probabilistic domain-specific language where BO is native, showing the Bayesian approach to optimization benchmarks and better equipped to address the above issues.
Edit intent: clarity
Original:  In the case of \alpha-H\"older drift in  recent literature the rate \alpha/2 was proved in many related situations.
Revised:  In the case of \alpha-H\"older drift in the recent literature the rate \alpha/2 was proved in many related situations.
Edit intent: fluency
Original:  We discuss the geometry and existence of solutions and how our results can  used for an error analysis.
Revised:  We discuss the geometry and existence of solutions and how our results can be used for an error analysis.
Edit intent: fluency
Original:  The trained and validated model was able to successfully differentiate between colon cancer and benign colon tissue images with 98 \% accuracy and 98 \% precision.
Revised:  The trained and validated model was able to successfully differentiate between colon cancer and benign colon tissue images with 98 \% recall and 98 \% precision.
Edit intent: clarity
Original:  A novel ECG classification algorithm is proposed for continuous cardiac monitoring on wearable devices with limited processing capacity.
Revised: Objective: A novel ECG classification algorithm is proposed for continuous cardiac monitoring on wearable devices with limited processing capacity.
Edit intent: clarity
Original:   The proposed solution employs a novel architecture consisting of wavelet transform and multiple LSTM recurrent neural networks (Fig. 1).
Revised:  Methods: The proposed solution employs a novel architecture consisting of wavelet transform and multiple LSTM recurrent neural networks (Fig. 1).
Edit intent: fluency
Original:   In contrast to many compute-intensive deep-learning based approaches, the proposed algorithm is lightweight, and therefore, brings continuous monitoring with accurate LSTM-based ECG classification to wearable devices   .
Revised:  Conclusion: In contrast to many compute-intensive deep-learning based approaches, the proposed algorithm is lightweight, and therefore, brings continuous monitoring with accurate LSTM-based ECG classification to wearable devices .
Edit intent: coherence
Original: In this paper, we analyse a new class of ( higher-order ) total directional variation regularisers, where the derivatives of a tensor-valued function are weighted by a collection of orientation fields.
Revised: We analyse a new class of ( higher-order ) total directional variation regularisers, where the derivatives of a tensor-valued function are weighted by a collection of orientation fields.
Edit intent: clarity
Original: In this paper, we analyse a new class of ( higher-order ) total directional variation regularisers, where the derivatives of a tensor-valued function are weighted by a collection of orientation fields.
Revised: In this paper, we analyse a new class of higher-order ) total directional variation regularisers, where the derivatives of a tensor-valued function are weighted by a collection of orientation fields.
Edit intent: fluency
Original:  We will also explore an alternative characterisation of the directional regulariser, in the same spirit of the work in Bredies and Holler (2014), which is helpful for the design of numerical schemes as shown in the complementary part of this work, Parisotto et al. (2018) .
Revised:  We will also explore an alternative characterisation of the directional regulariser, in the same spirit of the work in Bredies and Holler (2014), which is helpful for the design of numerical schemes as shown in a companion paper .
Edit intent: clarity
Original:  We prove some properties of  the associated tensor space, the existence of solutions to a canonically related regularity-fidelity optimization problem, and we prove a decomposition formula for this new criterion which appears to be helpful for the design of numerical schemes  as shown in a companion paper  .
Revised:  We prove some properties of the existence of solutions to a canonically related regularity-fidelity optimization problem, and we prove a decomposition formula for this new criterion which appears to be helpful for the design of numerical schemes as shown in a companion paper .
Edit intent: coherence
Original:  We prove some properties of  the associated tensor space, the existence of solutions to a canonically related regularity-fidelity optimization problem, and we prove a decomposition formula for this new criterion which appears to be helpful for the design of numerical schemes  as shown in a companion paper  .
Revised:  We prove some properties of the associated tensor space, the existence of solutions to a related regularity-fidelity optimization problem, and we prove a decomposition formula for this new criterion which appears to be helpful for the design of numerical schemes as shown in a companion paper .
Edit intent: clarity
Original:  We prove some properties of  the associated tensor space, the existence of solutions to a canonically related regularity-fidelity optimization problem, and we prove a decomposition formula for this new criterion which appears to be helpful for the design of numerical schemes  as shown in a companion paper  .
Revised:  We prove some properties of the associated tensor space, the existence of solutions to a canonically related regularity-fidelity optimisation problem. We also prove a decomposition formula for this new criterion which appears to be helpful for the design of numerical schemes as shown in a companion paper .
Edit intent: clarity
Original:  We prove some properties of  the associated tensor space, the existence of solutions to a canonically related regularity-fidelity optimization problem, and we prove a decomposition formula for this new criterion which appears to be helpful for the design of numerical schemes  as shown in a companion paper  .
Revised:  We prove some properties of the associated tensor space, the existence of solutions to a canonically related regularity-fidelity optimization problem, and we prove a decomposition formula which appears to be helpful for the design of numerical schemes as shown in a companion paper .
Edit intent: clarity
Original:  We prove some properties of  the associated tensor space, the existence of solutions to a canonically related regularity-fidelity optimization problem, and we prove a decomposition formula for this new criterion which appears to be helpful for the design of numerical schemes  as shown in a companion paper  .
Revised:  We prove some properties of the associated tensor space, the existence of solutions to a canonically related regularity-fidelity optimization problem, and we prove a decomposition formula for this new criterion which appears to be helpful for the design of numerical schemes , as shown in a companion paper .
Edit intent: fluency
Original:  We also prove a decomposition formula which appears to be helpful for the design of numerical schemes, as shown in a companion paper  where several applications to image processing are studied.
Revised:  We also prove a decomposition formula which appears to be helpful for the design of numerical schemes, as shown in a companion paper , where several applications to image processing are studied.
Edit intent: fluency
Original:  It is known that, given a graph G and an integer k, checking whether evc(G) \le k is NP-Hard . However, for any graph G,  mvc(G) \le evc(G) \le 2 mvc(G), where mvc(G) is the minimum vertex cover number of G. Precise value of eternal vertex cover number is known only for certain very basic graph classes like trees, cycles and grids.
Revised:  It is known that, given a graph G and an integer k, checking whether evc(G) \le k is NP-hard . However, for any graph G, mvc(G) \le evc(G) \le 2 mvc(G), where mvc(G) is the minimum vertex cover number of G. Precise value of eternal vertex cover number is known only for certain very basic graph classes like trees, cycles and grids.
Edit intent: fluency
Original:  It is known that, given a graph G and an integer k, checking whether evc(G) \le k is NP-Hard . However, for any graph G,  mvc(G) \le evc(G) \le 2 mvc(G), where mvc(G) is the minimum vertex cover number of G. Precise value of eternal vertex cover number is known only for certain very basic graph classes like trees, cycles and grids.
Revised:  It is known that, given a graph G and an integer k, checking whether evc(G) \le k is NP-Hard . However, for any graph G, it is known that mvc(G) \le evc(G) \le 2 mvc(G), where mvc(G) is the minimum vertex cover number of G. Precise value of eternal vertex cover number is known only for certain very basic graph classes like trees, cycles and grids.
Edit intent: fluency
Original:  Though a characterization is known for graphs for which evc(G) = 2mvc (G), a characterization of graphs for which evc(G) = mvc(G) remained open.
Revised:  Though a characterization is known for graphs for which evc(G) = 2 mvc (G), a characterization of graphs for which evc(G) = mvc(G) remained open.
Edit intent: fluency
Original:  It is also shown that deciding whether evc(G)%DIFDELCMD < \le %%% k is NP-Complete even for biconnected internally triangulated planar graphs  .
Revised:  %DIFDELCMD < \le %%% k is NP-Complete even for biconnected internally triangulated planar graphs .
Edit intent: coherence
Original:  We take a data-driven approach for fiber reconstruction from raw diffusion MRI, without assuming a specific diffusion model.
Revised:  We adopt a data-driven approach for fiber reconstruction from raw diffusion MRI, without assuming a specific diffusion model.
Edit intent: fluency
Original:  We use a recurrent neural network for mapping sequences of diffusion-weighted imaging (DWI ) values into probabilistic fiber orientation distributions.
Revised:  We use a recurrent neural network for mapping sequences of DWI values into probabilistic fiber orientation distributions.
Edit intent: clarity
Original:  Based on these estimations, our model can perform both deterministic and probabilistic tractography on unseen DWI datasets .
Revised:  Based on these estimations, our model facilitates both deterministic and probabilistic tractography on unseen DWI datasets .
Edit intent: clarity
Original:  We further present qualitative results of bundle-specific probabilistic tractography of our method.
Revised:  We further present qualitative results of bundle-specific probabilistic tractography obtained using our method.
Edit intent: clarity
Original: We present DeepTract, a deep-learning framework for estimation of white matter fibers orientation and streamline tractography.
Revised: We present DeepTract, a deep-learning framework for estimating white matter fibers orientation and streamline tractography.
Edit intent: fluency
Original:  We adopt a data-driven approach for fiber reconstruction from diffusion-weighted images (DWI), which does not assume a specific diffusion model.
Revised:  We adopt a data-driven approach for fiber reconstruction from diffusion weighted images (DWI), which does not assume a specific diffusion model.
Edit intent: fluency
Original:  We quantitatively evaluate our method using the Tractometer tool, demonstrating comparable performance to state-of-the-art classical and machine learning based tractography algorithms.
Revised:  We quantitatively evaluate our method using the Tractometer tool, demonstrating competitive performance with state-of-the art classical and machine learning based tractography algorithms.
Edit intent: clarity
Original:  We look at two separate formulations of the phase recovery problem from the literature, both  which can be minimized with respect to either the recovered phase or the recovered image.
Revised:  We look at two different formulations of the phase recovery problem from the literature, both which can be minimized with respect to either the recovered phase or the recovered image.
Edit intent: clarity
Original:  We look at two separate formulations of the phase recovery problem from the literature, both  which can be minimized with respect to either the recovered phase or the recovered image.
Revised:  We look at two separate formulations of the phase recovery problem from the literature, both of which can be minimized with respect to either the recovered phase or the recovered image.
Edit intent: fluency
Original:  We implement efficient Gauss-Newton optimization schemes for the all formulations.
Revised:  We implement efficient Gauss-Newton optimization schemes for all the formulations.
Edit intent: fluency
Original:  For the two of these formulations which optimize with respect to the recovered image, we also extend to projected Gauss-Newton to enforce element-wise lower and upper bounds on  pixel intensities of the recovered image.
Revised:  For the two of these formulations which optimize with respect to the recovered image, we also extend to projected Gauss-Newton to enforce element-wise lower and upper bounds on the pixel intensities of the recovered image.
Edit intent: fluency
Original:  Hair cells of certain species are also known to oscillate without external stimulation, indicating the presence of an underlying active mechanism.
Revised:  Hair bundles of certain species are also known to oscillate without external stimulation, indicating the presence of an underlying active mechanism.
Edit intent: clarity
Original:  We previously demonstrated that these spontaneous oscillations exhibit chaotic dynamics .
Revised:  We propose that chaotic dynamics enhance the sensitivity and temporal resolution of the hair bundle response, and provide experimental and theoretical evidence for this effect .
Edit intent: clarity
Original:  By varying the Calcium concentration and the viscosity of the Endolymph solution , we are able to modulate the degree of chaos  in the hair cell dynamics .
Revised:  By varying the viscosity and ionic composition of the surrounding fluid , we are able to modulate the degree of chaos in the hair cell dynamics .
Edit intent: clarity
Original:  By varying the Calcium concentration and the viscosity of the Endolymph solution , we are able to modulate the degree of chaos  in the hair cell dynamics .
Revised:  By varying the Calcium concentration and the viscosity of the Endolymph solution , we are able to modulate the degree of chaos observed in the hair cell dynamics .
Edit intent: clarity
Original:  We find that the hair cell is most sensitive to a stimulus of small amplitude when it is poised in the weakly chaotic regime.
Revised:  We find that the hair bundle is most sensitive to a stimulus of small amplitude when it is poised in the weakly chaotic regime.
Edit intent: clarity
Original:  These results agree well with our numerical simulations of a chaotic Hopf oscillator and suggest that chaos may be responsible for the extreme sensitivity and temporal resolution of hair cells.
Revised:  These results agree well with our numerical simulations of a chaotic Hopf oscillator and suggest that chaos may be responsible for the sensitivity and temporal resolution of hair cells.
Edit intent: clarity
Original: We present a graphical simulation tool for visually and interactively exploring the processing of a variety of events handled by an operating system when running a program.
Revised: We present a graphical simulation tool for visually and interactively exploring the processing of various events handled by an operating system when running a program.
Edit intent: fluency
Original: The Sinkhorn distance , a variant of the Wasserstein distance with entropic regularization, is an increasingly popular tool in machine learning and statistical inference.
Revised: The Sinkhorn "distance" , a variant of the Wasserstein distance with entropic regularization, is an increasingly popular tool in machine learning and statistical inference.
Edit intent: clarity
Original: The transient distribution of a sample taken from a Wright-Fisher diffusion with general small mutation rates is found using a coalescent approach.
Revised: The transition distribution of a sample taken from a Wright-Fisher diffusion with general small mutation rates is found using a coalescent approach.
Edit intent: fluency
Original:  The sampling distribution leads to a solution for the transition functions in the diffusion with small mutation rates.
Revised:  The sampling distribution leads to an approximation for the transition functions in the diffusion with small mutation rates.
Edit intent: clarity
Original:  The sampling distribution leads to a solution for the transition functions in the diffusion with small mutation rates.
Revised:  The sampling distribution leads to a solution for the transition density in the diffusion with small mutation rates.
Edit intent: clarity
Original:  This new solution has interest because transition functions in a Wright-Fisher diffusion with general mutation rates are not known.
Revised:  This new solution has interest because the transition density in a Wright-Fisher diffusion with general mutation rates are not known.
Edit intent: clarity
Original:  This new solution has interest because transition functions in a Wright-Fisher diffusion with general mutation rates are not known.
Revised:  This new solution has interest because transition functions in a Wright-Fisher diffusion with general mutation rates is not known.
Edit intent: fluency
Original:  In this contribution we demonstrate the analyticity of generalized Graetz solutions associated with layered domains: either cylindrical (possibly concentric) or parallel.
Revised:  In this contribution we demonstrate the ana-lyticity of generalized Graetz solutions associated with layered domains: either cylindrical (possibly concentric) or parallel.
Edit intent: fluency
Original: We report a new model of artificial life called Lenia (from Latin lenis "smooth"), a two-dimensional cellular automaton with continuous space-time-state and generalized local rule.
Revised: We report a new system of artificial life called Lenia (from Latin lenis "smooth"), a two-dimensional cellular automaton with continuous space-time-state and generalized local rule.
Edit intent: clarity
Original:  We present basic observations of the model regarding the properties of space-time and basic settings.
Revised:  We present basic observations of the system regarding the properties of space-time and basic settings.
Edit intent: clarity
Original:  We provide a board survey of the lifeforms, categorize them into a hierarchical taxonomy, and map their distribution in the parameter hyperspace.
Revised:  We provide a broad survey of the lifeforms, categorize them into a hierarchical taxonomy, and map their distribution in the parameter hyperspace.
Edit intent: fluency
Original:  Therefore, we also propose a partitioned space-time scheme that allow us to select the length of every time slab, and solve sequentially for every subdomain.
Revised:  Therefore, we also propose a partitioned space-time scheme that allows us to select the length of every time slab, and solve sequentially for every subdomain.
Edit intent: fluency
Original: Security vulnerability analysis of Integrated Circuits using conventional design-time validation and verification techniques  is generally a computationally intensive task and incomplete by nature,  under limited resources and time  .
Revised: Security vulnerability analysis of Integrated Circuits using conventional design-time validation and verification techniques is generally a computationally intensive task and incomplete by nature, especially under limited resources and time .
Edit intent: coherence
Original: Security vulnerability analysis of Integrated Circuits using conventional design-time validation and verification techniques  is generally a computationally intensive task and incomplete by nature,  under limited resources and time  .
Revised: Security vulnerability analysis of Integrated Circuits using conventional design-time validation and verification techniques is generally a computationally intensive task and incomplete by nature, under limited resources and time constraints .
Edit intent: clarity