wanyu/IteraTeR_v2 huggingface dataset:
Original:  This class includes important examples, such as objectives for structured sparse learning and variance reduction in Bayesian optimization.
Revised:  This includes important examples, such as objectives for structured sparse learning and variance reduction in Bayesian optimization.
Edit intent: coherence
Original: We present a method to efficiently solve the optimal transportation problem for a general class of strictly convex costs  . Given two probability measures supported on a discrete grid with n points  we compute the optimal transport map between them in O(n log(n) ) operations and O(n ) storage space .
Revised: We present a method to efficiently solve the optimal transportation problem for a class of strictly convex costs . Given two probability measures supported on a discrete grid with n points we compute the optimal transport map between them in O(n log(n) ) operations and O(n ) storage space .
Edit intent: clarity
Original: We present a method to efficiently solve the optimal transportation problem for a general class of strictly convex costs  . Given two probability measures supported on a discrete grid with n points  we compute the optimal transport map between them in O(n log(n) ) operations and O(n ) storage space .
Revised: We present a method to efficiently solve the optimal transportation problem for a general class of strictly convex costs . Given two probability measures supported on a discrete grid with n points , we compute the optimal transport map between them in O(n log(n) ) operations and O(n ) storage space .
Edit intent: fluency
Original: We present a method to efficiently solve the optimal transportation problem for a general class of strictly convex costs  . Given two probability measures supported on a discrete grid with n points  we compute the optimal transport map between them in O(n log(n) ) operations and O(n ) storage space .
Revised: We present a method to efficiently solve the optimal transportation problem for a general class of strictly convex costs . Given two probability measures supported on a discrete grid with n points we compute the optimal map using O(n log(n) ) operations and O(n ) storage space .
Edit intent: clarity
Original: We present a method to efficiently solve the optimal transportation problem for a general class of strictly convex costs  . Given two probability measures supported on a discrete grid with n points  we compute the optimal transport map between them in O(n log(n) ) operations and O(n ) storage space .
Revised: We present a method to efficiently solve the optimal transportation problem for a general class of strictly convex costs . Given two probability measures supported on a discrete grid with n points we compute the optimal transport map between them in O(n ) storage space and O(n ) storage space .
Edit intent: clarity
Original: The supermarket model typically refers to a system with a large number of queues, where arriving customers choose d queues at random and join the queue with  fewest customers.
Revised: The supermarket model refers to a system with a large number of queues, where arriving customers choose d queues at random and join the queue with fewest customers.
Edit intent: clarity
Original: The supermarket model typically refers to a system with a large number of queues, where arriving customers choose d queues at random and join the queue with  fewest customers.
Revised: The supermarket model typically refers to a system with a large number of queues, where arriving customers choose d queues at random and join the queue with the fewest customers.
Edit intent: fluency
Original:  Our study leaves many natural  open questions for further work.
Revised:  Our study leaves many natural open questions for future work.
Edit intent: fluency
Original:  In this study, we propose a dimension reduction approach to visualize and interpret the representation of the data by these models.
Revised:  In this study, we propose a dimension reduction approach to visualize and interpret the representation of data by these models.
Edit intent: fluency
Original: Software defined networking (SDN) is rapidly growing networking paradigmin both industry and research areas, with network programmability as its powerful feature which enables propagating changes in the network easily.
Revised: Software-defined networking (SDN) is rapidly growing networking paradigmin both industry and research areas, with network programmability as its powerful feature which enables propagating changes in the network easily.
Edit intent: fluency
Original:  The logically centralized control in SDN enables dynamically minimizing the energy consumption of the links and the switches by diverting paths of packets.
Revised:  The logically centralized control , enables dynamically minimizing the energy consumption of the links and the switches by diverting paths of packets.
Edit intent: clarity
Original:  The logically centralized control in SDN enables dynamically minimizing the energy consumption of the links and the switches by diverting paths of packets.
Revised:  The logically centralized control in SDN enables dynamically minimizing the network energy consumption by redirecting paths of packets.
Edit intent: clarity
Original:  Furthermore, energy efficiency and performance are opposite objectives that have to be addressed simultaneously .
Revised:  Furthermore, energy efficiency and network performance that need to be considered together .
Edit intent: clarity
Original:  Such discrete energetic variational approaches are analogous to energetic variational approaches in a semidiscrete level, which provide a basis of deriving the "semi-discrete equations" and can be applied to a large class of partial differential equations with energy-dissipation laws and the kinematic relations.
Revised:  Such discrete energetic variational approaches are analogous to energetic variational approaches in a semidiscrete level, which provide a basis of deriving the "semi-discrete equations" and can be applied to a large class of partial differential equations with energy-dissipation laws and kinematic relations.
Edit intent: fluency
Original:  We propose FTK , an optimal interpolation method which represents images in a Fourier-Bessel basis and uses a rank-H approximation of the translation kernel via an operator singular value decomposition (SVD).
Revised:  We propose FTK , an optimal interpolation method which represents images in a Fourier--Bessel basis and uses a rank-H approximation of the translation kernel via an operator singular value decomposition (SVD).
Edit intent: fluency
Original:  To model this process, we consider that cellsdivide and die as a branching process, and that each cell contains a sequence of nucleotides which can mutate at cell division.
Revised:  To model this process, we consider that cellsdivide and die as a branching process, and each cell contains a sequence of nucleotides which can mutate at cell division.
Edit intent: fluency
Original: We study a fundamental model of DNA evolution in a growing population of cells : cell divisions follow the Yule process, and each cell contains a sequence of nucleotides which can mutate at cell division.
Revised: We study a simple model of DNA evolution in a growing population of cells : cell divisions follow the Yule process, and each cell contains a sequence of nucleotides which can mutate at cell division.
Edit intent: clarity
Original: We study a fundamental model of DNA evolution in a growing population of cells : cell divisions follow the Yule process, and each cell contains a sequence of nucleotides which can mutate at cell division.
Revised: We study a fundamental model of DNA evolution in a growing population of cells . Each cell contains a nucleotide sequence which randomly mutates at cell division.
Edit intent: clarity
Original:  Here we present a novel, generative model for inferring the source of individual spikes given observed electrical traces .
Revised:  Here we present a novel, generative model for inferring the source of individual spikes on high-density, microelectrode arrays .
Edit intent: clarity
Original:  To allow for scalable , efficient inference, we implement our model as a variational autoencoder and perform amortized variational inference.
Revised:  To allow for scalable inference, we implement our model as a variational autoencoder and perform amortized variational inference.
Edit intent: clarity
Original: Determining the positions of neurons in an extracellular recording is useful for investigating the functional properties of the underlying neural circuitry.
Revised: Determining the positions of neurons in an extracellular recording is useful for investigating functional properties of the underlying neural circuitry.
Edit intent: fluency
Original:  Although it is often argued that this representational format is useful in learning to solve many real-world up-stream tasks, there is little empirical evidence that supports this claim.
Revised:  Although it is often argued that this representational format is useful in learning to solve many real-world down-stream tasks, there is little empirical evidence that supports this claim.
Edit intent: fluency
Original:  In particular, they appear to enable quicker learning using fewer samples.
Revised:  In particular, they enable quicker learning using fewer samples.
Edit intent: clarity
Original:  Smooth shells define a series of coarse-to-fine , smooth shape approximations that are designed to work well with multiscale algorithms.
Revised:  Smooth shells define a series of coarse-to-fine shape approximations designed to work well with multiscale algorithms.
Edit intent: fluency
Original: All the FFT-based methods available for homogenization of the mechanical response share a common point: the unknown field is the strain/deformation gradient , second order tensors which compatibility is imposed using Green's function or projection operators.
Revised: Most of the FFT methods available for homogenization of the mechanical response share a common point: the unknown field is the strain/deformation gradient , second order tensors which compatibility is imposed using Green's function or projection operators.
Edit intent: clarity
Original: All the FFT-based methods available for homogenization of the mechanical response share a common point: the unknown field is the strain/deformation gradient , second order tensors which compatibility is imposed using Green's function or projection operators.
Revised: All the FFT-based methods available for homogenization of the mechanical response use the strain/deformation gradient , second order tensors which compatibility is imposed using Green's function or projection operators.
Edit intent: coherence
Original: All the FFT-based methods available for homogenization of the mechanical response share a common point: the unknown field is the strain/deformation gradient , second order tensors which compatibility is imposed using Green's function or projection operators.
Revised: All the FFT-based methods available for homogenization of the mechanical response share a common point: the unknown field is the strain/deformation gradient , second order tensors which compatibility is imposed using Green's functions or projection operators.
Edit intent: fluency
Original:  This implies the allocation of redundant information and, when the method is based in a solving a linear system , the rank-deficiency of the resulting systems .
Revised:  This implies the allocation of redundant information and, when the method is based in solving a linear system , the rank-deficiency of the resulting systems .
Edit intent: fluency
Original:  This implies the allocation of redundant information and, when the method is based in a solving a linear system , the rank-deficiency of the resulting systems .
Revised:  This implies the allocation of redundant information and, when the method is based in a solving a linear equation , the rank-deficiency of the resulting systems .
Edit intent: clarity
Original:  This implies the allocation of redundant information and, when the method is based in a solving a linear system , the rank-deficiency of the resulting systems .
Revised:  This implies the allocation of redundant information and, when the method is based in a solving a linear system , the rank-deficiency of the resulting system .
Edit intent: fluency
Original:  In this work we propose a new, fast, robust and memory-efficient FFT approach in which the displacement field on the Fourier space is the unknown: the displacement based FFT (DBFFT) algorithm.
Revised:  In this work we propose a fast, robust and memory-efficient FFT approach in which the displacement field on the Fourier space is the unknown: the displacement based FFT (DBFFT) algorithm.
Edit intent: clarity
Original:   In the linear case, the method results in a linear equation defined in terms of linear operators in the Fourier space and that does not require a reference medium.
Revised:  In the linear case, the method results in a linear system defined in terms of linear operators in the Fourier space and that does not require a reference medium.
Edit intent: clarity
Original:  The method is extended to non-linear problems and strain, stress and mixed control.
Edit intent: coherence
Original:  In particular, we design and estimate the condition number of restricted additive Schwarz methods .
Revised:  In particular, we design and estimate the condition number of the preconditioned operator .
Edit intent: clarity
Original:  We also obtain  non-negativity of the pre-conditioner operator.
Revised:  We also obtain the non-negativity of the pre-conditioner operator.
Edit intent: fluency
Original:  We also obtain  non-negativity of the pre-conditioner operator.
Revised:  We also obtain non-negativity of the preconditioned operator.
Edit intent: fluency
Original:  Condition number estimates are not enough for the convergence of iterative method such as GMRES but these bounds may lead to further understanding of restricted methods.
Revised:  Condition number estimates are not enough for the convergence of iterative methods such as GMRES but these bounds may lead to further understanding of restricted methods.
Edit intent: fluency
Original:  We consider  discretization of the problem with the discontinuous Galerkin method with arbitrary order r \in N  . Under suitable regularity assumptions on the cost functional and solutions of the state equations, we provide sharp estimates for the error of the approximate solutions.
Revised:  We consider a discretization of the problem with the discontinuous Galerkin method with arbitrary order r \in N . Under suitable regularity assumptions on the cost functional and solutions of the state equations, we provide sharp estimates for the error of the approximate solutions.
Edit intent: fluency
Original: Given unpaired data from multiple domains, a key challenge is to efficiently exploit these data sources for modeling a target domain.
Revised: Given datasets from multiple domains, a key challenge is to efficiently exploit these data sources for modeling a target domain.
Edit intent: clarity
Original:  We propose AlignFlow, a generative modeling framework for learning from multiple domains via normalizing flows .
Revised:  We propose AlignFlow, a generative modeling framework that models each domain via a normalizing flow .
Edit intent: clarity
Original:  The use of normalizing flows in AlignFlow allows for a) flexibility in specifying learning objectives via adversarial training, maximum likelihood estimation, or a hybrid of the two methods;
Revised:  The use of normalizing flows allows for a) flexibility in specifying learning objectives via adversarial training, maximum likelihood estimation, or a hybrid of the two methods;
Edit intent: clarity
Original:  and b)  exact inference of the shared latent factors across domains at test time .
Revised:  and b) learning and exact inference of the shared latent factors across domains at test time .
Edit intent: clarity
Original:  and b)  exact inference of the shared latent factors across domains at test time .
Revised:  and b) exact inference of a shared representation in the latent space of the generative model .
Edit intent: clarity
Original:  We derive theoretical results for the conditions under which AlignFlow guarantees marginal consistency for the different learning objectives.
Revised:  We derive a uniform set of conditions under which AlignFlow guarantees marginal consistency for the different learning objectives.
Edit intent: clarity
Original:  We derive theoretical results for the conditions under which AlignFlow guarantees marginal consistency for the different learning objectives.
Revised:  We derive theoretical results for the conditions under which AlignFlow is marginally-consistent for the different learning objectives.
Edit intent: clarity
Original:  Furthermore, we show that AlignFlow guarantees exact cycle consistency in mapping datapoints from one domain to another . Empirically, AlignFlow can be used for data-efficient density estimation given multiple data sources and shows significant improvements over relevant baselines on  unsupervised domain adaptation  .
Revised:  Furthermore, we show that AlignFlow guarantees exact cycle consistency in mapping datapoints from a source domain to target and back to the source domain . Empirically, AlignFlow can be used for data-efficient density estimation given multiple data sources and shows significant improvements over relevant baselines on unsupervised domain adaptation .
Edit intent: clarity
Original:  Furthermore, we show that AlignFlow guarantees exact cycle consistency in mapping datapoints from one domain to another . Empirically, AlignFlow can be used for data-efficient density estimation given multiple data sources and shows significant improvements over relevant baselines on  unsupervised domain adaptation  .
Revised:  Furthermore, we show that AlignFlow guarantees exact cycle consistency in mapping datapoints from one domain to another . Empirically, AlignFlow outperforms relevant baselines on unsupervised domain adaptation .
Edit intent: clarity
Original:  In this paper, we talk about one such optimization mechanism prevalent in modern Linux based operating system , called page frame cache, which is an integral part of physical memory allocation subsystem.
Revised:  In this paper, we talk about one such optimization mechanism prevalent in modern Linux based operating systems , called page frame cache, which is an integral part of physical memory allocation subsystem.
Edit intent: fluency
Original:  It is a purely software cache storing the page frames that are recently being released by the process or processes running on the corresponding CPU.
Revised:  It is a purely software cache storing the page frames that are recently being released by the processes running on the corresponding CPU.
Edit intent: clarity
Original:  Our main tool for this generalization is non-binary span program which has recently been developed for non-binary functions, as well as the dual adversary bound.
Revised:  Our main tool for this generalization is non-binary span program which has recently been developed for non-binary functions, and the dual adversary bound.
Edit intent: coherence
Original:  However, almost all of these applications have focused on large spatial scales, typically from intra-city level to inter-country level .
Revised:  However, almost all of these applications have focused on large spatial scales, which typically range between intra-city level to inter-country level .
Edit intent: clarity
Original:  However, almost all of these applications have focused on large spatial scales, typically from intra-city level to inter-country level .
Revised:  However, almost all of these applications have focused on large spatial scales, typically from intra-city scales to inter-country level .
Edit intent: fluency
Original:  However, almost all of these applications have focused on large spatial scales, typically from intra-city level to inter-country level .
Revised:  However, almost all of these applications have focused on large spatial scales, typically from intra-city level to inter-country scales .
Edit intent: fluency
Original:  We find that a doubly-constrained gravity model and an extended radiation model ( a variant of the intervening-opportunities model) can successfully estimate 65--70\\%DIF < of the %DIF > of  flow inside supermarkets.
Revised:  We find that a doubly-constrained gravity model and an extended radiation model ( which is a type of intervening-opportunities model) can successfully estimate 65--70\\%DIF < of the %DIF > of flow inside supermarkets.
Edit intent: clarity
Original:  We find that a doubly-constrained gravity model and an extended radiation model ( a variant of the intervening-opportunities model) can successfully estimate 65--70\\%DIF < of the %DIF > of  flow inside supermarkets.
Revised:  We find that a doubly-constrained gravity model and an extended radiation model ( a variant of the intervening-opportunities model) can successfully estimate 65--70\\%DIF < of the %DIF > of the flow inside supermarkets.
Edit intent: fluency
Original:  Using the gravity model as a case study, we then investigate how to reduce congestion in supermarkets using mobility models.
Revised:  Using a gravity model as a case study, we then investigate how to reduce congestion in supermarkets using mobility models.
Edit intent: fluency
Original:  We model each supermarket zone as a queue ;
Revised:  We model each supermarket zone as a queue ,
Edit intent: fluency
Original:  and we use the gravity model to identify store layouts with low congestion, which we measure either by the maximum number of visits to a zone or by the total mean queue size.
Revised:  and we use a gravity model to identify store layouts with low congestion, which we measure either by the maximum number of visits to a zone or by the total mean queue size.
Edit intent: fluency
Original:  We then use a simulated-annealing algorithm to find store layouts with lower congestion than the original layout.
Revised:  We then use a simulated-annealing algorithm to find store layouts with lower congestion than a supermarket's original layout.
Edit intent: clarity
Original:  In these optimized store layouts,  popular zones are often in the perimeter of a store.
Revised:  In these optimized store layouts, we find that popular zones are often in the perimeter of a store.
Edit intent: coherence
Original:  We further describe how we adapted the design study methodology to the `moving target' of both the data and the domain experts' concerns and how this movement kept both the visualization and programming project healthy.
Revised:  We further describe how we adapted the design study methodology to the "moving target" of both the data and the domain experts' concerns and how this movement kept both the visualization and programming project healthy.
Edit intent: fluency
Original:  The observed difference  complexity between the two conscious arousal states increases as higher orders of temporal correlations are taken into account.
Revised:  The observed difference in complexity between the two conscious arousal states increases as higher orders of temporal correlations are taken into account.
Edit intent: clarity
Original:  The observed difference  complexity between the two conscious arousal states increases as higher orders of temporal correlations are taken into account.
Revised:  The observed difference complexity between the two states of conscious arousal increases as higher orders of temporal correlations are taken into account.
Edit intent: clarity
Original: We apply techniques from the field of computational mechanics to evaluate the statistical complexity of neural recording data in fruit flies.
Revised: We apply techniques from the field of computational mechanics to evaluate the statistical complexity of neural recording data from fruit flies.
Edit intent: fluency
Original:  We connect statistical complexity to the flies' level of conscious arousal, which is manipulated by general anaesthesia (isoflurane).
Revised:  First, we connect statistical complexity to the flies' level of conscious arousal, which is manipulated by general anaesthesia (isoflurane).
Edit intent: fluency