wanyu/IteraTeR_v2 huggingface dataset:
Original: In this paper, we generalize the work in Almgren-Chriss  to a more realistic and flexible framework and employ it to derive and analyze some aspects of optimal execution problem in a security market.
Revised: In this paper, we generalize the work in Almgren-Chriss to a more realistic and flexible framework and employ it to derive and analyze some aspects of optimal liquidation problem in a security market.
Edit intent: clarity
Original:  We illustrate how  trader's execution strategy alters when multiple venues , and extra information are brought into the security market and detected by the trader.
Revised:  We illustrate how a trader's execution strategy alters when multiple venues , and extra information are brought into the security market and detected by the trader.
Edit intent: fluency
Original:  We illustrate how  trader's execution strategy alters when multiple venues , and extra information are brought into the security market and detected by the trader.
Revised:  We illustrate how trader's execution strategy alters when multiple venues and extra information are brought into the security market and detected by the trader.
Edit intent: fluency
Original:  This study gives some new insights into the relationship between execution strategy and market liquidity, and provides a multi-scale approach to the optimal execution problem with randomly varying volatility.
Revised:  This study gives some new insights into the relationship between liquidation strategy and market liquidity, and provides a multi-scale approach to the optimal execution problem with randomly varying volatility.
Edit intent: clarity
Original:  This study gives some new insights into the relationship between execution strategy and market liquidity, and provides a multi-scale approach to the optimal execution problem with randomly varying volatility.
Revised:  This study gives some new insights into the relationship between execution strategy and market liquidity, and provides a multi-scale approach to the optimal liquidation problem with randomly varying volatility.
Edit intent: clarity
Original: In this paper , we propose a numerical method for verifying solutions to the semilinear elliptic equation - \Delta u= f(u) with homogeneous Dirichlet boundary condition. u In particular, we consider the case in which the Fr\'echet derivative of f is not Lipschitz continuous.
Revised: In this paper , we propose a numerical method for verifying solutions to the semilinear elliptic equation - \Delta u= f(u) with homogeneous Dirichlet boundary condition. u In particular, we consider the case in which the Fr\'echet derivative of f is not Lipschitz continuous.
Edit intent: fluency
Original: In this paper , we propose a numerical method for verifying solutions to the semilinear elliptic equation - \Delta u= f(u) with homogeneous Dirichlet boundary condition. u In particular, we consider the case in which the Fr\'echet derivative of f is not Lipschitz continuous.
Revised: In this paper , we propose a numerical method for verifying solutions to the semilinear elliptic equation - \Delta u= f(u) with homogeneous Dirichlet boundary condition. u. In particular, we consider the case in which the Fr\'echet derivative of f is not Lipschitz continuous.
Edit intent: fluency
Original: Automatic social circle detection in ego-networks is becoming a fundamentally important taskfor social network analysis, which can be used for privacy protection or interest group recommendation.
Revised: In social network analysis, automatic social circle detection in ego-networks is becoming a fundamentally important taskfor social network analysis, which can be used for privacy protection or interest group recommendation.
Edit intent: fluency
Original: Automatic social circle detection in ego-networks is becoming a fundamentally important taskfor social network analysis, which can be used for privacy protection or interest group recommendation.
Revised: Automatic social circle detection in ego-networks is becoming a fundamental and important task, with many potential applications such as user privacy protection or interest group recommendation.
Edit intent: clarity
Original:  So far, most studies focused on how to detect overlapping circles or how to perform detection using both network structure and its node profiles .
Revised:  So far, most studies focused on how to detect overlapping circles and how to detect circles using a combination of network structure and its node profiles .
Edit intent: clarity
Original:  So far, most studies focused on how to detect overlapping circles or how to perform detection using both network structure and its node profiles .
Revised:  So far, most studies focused on how to detect overlapping circles or how to perform detection using both network structure and network node attributes .
Edit intent: clarity
Original:  This paper asks an orthogonal research question : how to detect social circles by leveraging the multiple viewsof the network structure?
Revised:  This paper asks an orthogonal research question , that is, how to detect social circles by leveraging the multiple viewsof the network structure?
Edit intent: clarity
Original:  Then, we apply both standard and our modified multi-view spectral clustering methods on the graph to detect circles . Based on extensive automatic and manual  evaluations, we deliver two major findings: first, multi-view clustering methods detect better circles than single-view clustering methods;
Revised:  Then, we apply both standard and our modified multi-view spectral clustering methods on the graph to detect circles . Based on extensive automatic and manual experimental evaluations, we deliver two major findings: first, multi-view clustering methods detect better circles than single-view clustering methods;
Edit intent: clarity
Original:  Then, we apply both standard and our modified multi-view spectral clustering methods on the graph to detect circles . Based on extensive automatic and manual  evaluations, we deliver two major findings: first, multi-view clustering methods detect better circles than single-view clustering methods;
Revised:  Then, we apply both standard and our modified multi-view spectral clustering methods on the graph to detect circles . Based on extensive automatic and manual evaluations, we deliver two major findings: first, multi-view clustering techniques perform better than common single-view clustering methods;
Edit intent: clarity
Original:  By integrating theories from spectral clustering and matrix perturbation, we prove an information-theoretic upper bound for such bias and discuss how it may be affected by the characteristics of the social network .
Revised:  By integrating theories from spectral clustering and matrix perturbation, we prove an information-theoretic upper bound for such bias and discuss how it may be affected by several network characteristics .
Edit intent: clarity
Original:  Examining various asymptotically-optimal planning algorithms, we characterize settings, which we call NN-sensitive , in which the (practical) computational role of nearest-neighbor search is dominant, i.e., it takes up considerably more time than the time taken up by collision detection.
Revised:  Examining various asymptotically-optimal planning algorithms, we characterize settings, which we call NN-sensitive , in which the (practical) computational role of nearest-neighbor search is dominant, i.e., it takes up considerably more time than the time taken up by collision detection.
Edit intent: fluency
Original: The asymptotic computational complexity of nearest-neighbor search dominates the  running time of many sampling-based motion-planning algorithms.
Revised: The complexity of nearest-neighbor search dominates the running time of many sampling-based motion-planning algorithms.
Edit intent: clarity
Original: The asymptotic computational complexity of nearest-neighbor search dominates the  running time of many sampling-based motion-planning algorithms.
Revised: The asymptotic computational complexity of nearest-neighbor search dominates the asymptotic running time of many sampling-based motion-planning algorithms.
Edit intent: fluency
Original:  Examining various asymptotically-optimal planning algorithms, we characterize settings, which we call NN-sensitive, in which the (practical ) computational role of nearest-neighbor search is dominant , i.e., it takes up considerably more time than the time taken up by collision detection.
Revised:  Examining various asymptotically optimal planning algorithms, we characterize settings, which we call NN-sensitive, in which the (practical ) computational role of nearest-neighbor search is dominant , i.e., it takes up considerably more time than the time taken up by collision detection.
Edit intent: fluency
Original:  Examining various asymptotically-optimal planning algorithms, we characterize settings, which we call NN-sensitive, in which the (practical ) computational role of nearest-neighbor search is dominant , i.e., it takes up considerably more time than the time taken up by collision detection.
Revised:  Examining various asymptotically-optimal planning algorithms, we characterize settings, which we call NN-sensitive, in which the practical computational role of nearest-neighbor search is dominant , i.e., it takes up considerably more time than the time taken up by collision detection.
Edit intent: fluency
Original:  Examining various asymptotically-optimal planning algorithms, we characterize settings, which we call NN-sensitive, in which the (practical ) computational role of nearest-neighbor search is dominant , i.e., it takes up considerably more time than the time taken up by collision detection.
Revised:  Examining various asymptotically-optimal planning algorithms, we characterize settings, which we call NN-sensitive, in which the (practical ) computational role of nearest-neighbor search is dominant , i.e., the portion of running time taken up by nearest-neighbor search is comparable, or sometimes even greater than the portion of time taken up by collision detection.
Edit intent: clarity
Original:  Unfortunately, developing query optimizers re- mains a highly challenging task.
Revised:  Unfortunately, developing query optimizers remains a highly challenging task.
Edit intent: fluency
Original: The minrank of a graph G is the minimum rank of a matrix M that can be obtained from the adjacency matrix of G by switching  ones to zeros (i.e., deleting edges) and  setting all diagonal entries to one.
Revised: The minrank of a graph G is the minimum rank of a matrix M that can be obtained from the adjacency matrix of G by switching some ones to zeros (i.e., deleting edges) and setting all diagonal entries to one.
Edit intent: clarity
Original: The minrank of a graph G is the minimum rank of a matrix M that can be obtained from the adjacency matrix of G by switching  ones to zeros (i.e., deleting edges) and  setting all diagonal entries to one.
Revised: The minrank of a graph G is the minimum rank of a matrix M that can be obtained from the adjacency matrix of G by switching ones to zeros (i.e., deleting edges) and then setting all diagonal entries to one.
Edit intent: coherence
Original:  Our lower bound matches the well-known upper bound obtained by the "clique covering" solution, and settles the linear index coding problem for random knowledge graphs.
Revised:  Our lower bound matches the well-known upper bound obtained by the "clique covering" solution, and settles the linear index coding problem for random graphs.
Edit intent: clarity
Original: Locally-biased graph algorithms are algorithms that attempt to find local or small-scale structure in a typically large data graph.
Revised: Locally-biased graph algorithms are algorithms that attempt to find local or small-scale structure in a large data graph.
Edit intent: clarity
Original:  In some cases, this can be accomplished by adding some sort of locality constraint and calling a traditional graph algorithm , but more interesting are locally-biased graph algorithms that compute answers by running a procedure that does not even look at most of the  graph.
Revised:  In some cases, this can be accomplished by adding some sort of locality constraint and calling a traditional graph algorithm ; but more interesting are locally-biased graph algorithms that compute answers by running a procedure that does not even look at most of the graph.
Edit intent: fluency
Original:  In some cases, this can be accomplished by adding some sort of locality constraint and calling a traditional graph algorithm , but more interesting are locally-biased graph algorithms that compute answers by running a procedure that does not even look at most of the  graph.
Revised:  In some cases, this can be accomplished by adding some sort of locality constraint and calling a traditional graph algorithm , but more interesting are locally-biased graph algorithms that compute answers by running a procedure that does not even look at most of the input graph.
Edit intent: clarity
Original:  This corresponds more closely with what practitioners from various data science domains do, but it does not correspond well with the way that algorithmic and statistical theory is typically formulated.
Revised:  This corresponds more closely to what practitioners from various data science domains do, but it does not correspond well with the way that algorithmic and statistical theory is typically formulated.
Edit intent: fluency
Original:  Despite major advances in the analysis of Boolean functions over the last decade, the problem remains wide open.
Revised:  Despite major advances in the analysis of Boolean functions over the last decade, the problem remains widely open.
Edit intent: fluency
Original:  Recently, Gopalan et al. [ITCS '16] showed that every Boolean function f is uniquely specified by its values on a Hamming ball of radius at most 2 s (f).
Revised:  Recently, Gopalan et al. [ITCS '16] showed that every Boolean function f is uniquely specified by its values on a Hamming ball of radius at most 2s (f).
Edit intent: fluency
Original:  Then, we apply pooling operations on the frame vectors to create the final bag of attributes for the video.
Revised:  Then, we apply pooling operations to the frame vectors to create the final bag of attributes for the video.
Edit intent: fluency
Original:  Our experiments considered the semantic space created by a deep convolutional neural network (OverFeat) pre-trained on 1000 object categories of ImageNet.
Revised:  Our experiments considered the semantic space created by state-of-the-art convolutional neural networks pre-trained on 1000 object categories of ImageNet.
Edit intent: clarity
Original:  OverFeat was then used to classify each video frame and max pooling combined the frame vectors in the BoA representation for the video.
Revised:  Such deep neural networks were used to classify each video frame and max pooling combined the frame vectors in the BoA representation for the video.
Edit intent: clarity
Original:  OverFeat was then used to classify each video frame and max pooling combined the frame vectors in the BoA representation for the video.
Revised:  OverFeat was then used to classify each video frame and max pooling combined the frame vectors in the BoA representation for a video.
Edit intent: fluency
Original:  Results using BoA outperformed the baselines with statistical significance in the task of video event retrieval using the EVVE dataset  .
Revised:  Results using BoA were comparable or superior to the baselines in the task of video event retrieval using the EVVE dataset .
Edit intent: clarity
Original: The gravity equationhas been successful in establishing a connection between the amount of trade  between two countries , their respective gross domestic products and "  distance" ( a complex notion including geographical, historical, linguistic and sociological components ) . We take the inverse route and show that  it is possible to construct a meaningful 'distance' without any external information simply from knowing the bilateral trade volumes between countries .
Revised: Understanding international trade is a fundamental problem in economics -- one standard approach is via what is commonly called the "gravity equation", which predicts the total amount of trade between two countries , their respective gross domestic products and " distance" ( a complex notion including geographical, historical, linguistic and sociological components ) . We take the inverse route and show that it is possible to construct a meaningful 'distance' without any external information simply from knowing the bilateral trade volumes between countries .
Edit intent: coherence
Original: The gravity equationhas been successful in establishing a connection between the amount of trade  between two countries , their respective gross domestic products and "  distance" ( a complex notion including geographical, historical, linguistic and sociological components ) . We take the inverse route and show that  it is possible to construct a meaningful 'distance' without any external information simply from knowing the bilateral trade volumes between countries .
Revised: The gravity equationhas been successful in establishing a connection between the amount of trade between two countries , their respective gross domestic products and " distance" ( a complex notion that includes geographical, historical, linguistic and sociological components ) . We take the inverse route and show that it is possible to construct a meaningful 'distance' without any external information simply from knowing the bilateral trade volumes between countries .
Edit intent: fluency
Original: The gravity equationhas been successful in establishing a connection between the amount of trade  between two countries , their respective gross domestic products and "  distance" ( a complex notion including geographical, historical, linguistic and sociological components ) . We take the inverse route and show that  it is possible to construct a meaningful 'distance' without any external information simply from knowing the bilateral trade volumes between countries .
Revised: The gravity equationhas been successful in establishing a connection between the amount of trade between two countries , their respective gross domestic products and " distance" ( a complex notion including geographical, historical, linguistic and sociological components . We take the inverse route and show that it is possible to construct a meaningful 'distance' without any external information simply from knowing the bilateral trade volumes between countries .
Edit intent: fluency
Original: The gravity equationhas been successful in establishing a connection between the amount of trade  between two countries , their respective gross domestic products and "  distance" ( a complex notion including geographical, historical, linguistic and sociological components ) . We take the inverse route and show that  it is possible to construct a meaningful 'distance' without any external information simply from knowing the bilateral trade volumes between countries .
Revised: The gravity equationhas been successful in establishing a connection between the amount of trade between two countries , their respective gross domestic products and " distance" ( a complex notion including geographical, historical, linguistic and sociological components ) . We take the inverse it is possible to construct a meaningful 'distance' without any external information simply from knowing the bilateral trade volumes between countries .
Edit intent: coherence
Original: The gravity equationhas been successful in establishing a connection between the amount of trade  between two countries , their respective gross domestic products and "  distance" ( a complex notion including geographical, historical, linguistic and sociological components ) . We take the inverse route and show that  it is possible to construct a meaningful 'distance' without any external information simply from knowing the bilateral trade volumes between countries .
Revised: The gravity equationhas been successful in establishing a connection between the amount of trade between two countries , their respective gross domestic products and " distance" ( a complex notion including geographical, historical, linguistic and sociological components ) . We take the inverse route and show that it is possible to reconstruct meaningful information about countries simply from knowing the bilateral trade volumes between countries .
Edit intent: clarity
Original:  In this work, we generalize the results and the hardness problems presented by Lyubashevsky et al. to the more general case of multivariate rings, highlighting the main differences with respect to the security proof for the RLWE counterpart.
Revised:  In this work, we generalize these results and the hardness problems presented by Lyubashevsky et al. to the more general case of multivariate rings, highlighting the main differences with respect to the security proof for the RLWE counterpart.
Edit intent: fluency
Original:  In this work, we generalize the results and the hardness problems presented by Lyubashevsky et al. to the more general case of multivariate rings, highlighting the main differences with respect to the security proof for the RLWE counterpart.
Revised:  In this work, we generalize the results and the problems presented by Lyubashevsky et al. to the more general case of multivariate rings, highlighting the main differences with respect to the security proof for the RLWE counterpart.
Edit intent: clarity
Original:  We denote this hardness problem as "Multivariate Ring Learning with Errors" (m-RLWE or multivariate RLWE) and we show its relation to hardness problems over the tensor product of ideal lattices.
Revised:  This hardness problem is denoted as "Multivariate Ring Learning with Errors" (m-RLWE or multivariate RLWE) and we show its relation to hardness problems over the tensor product of ideal lattices.
Edit intent: clarity
Original:  \binom { } \binom { } 
Revised:  \binom { } is replaced by\binom { } 
Edit intent: coherence
Original:  In addition, with assortative coupling, the traffic capacity of the system will decrease significantly.
Revised:  In addition, with assortative coupling, the transportation capacity of the system will decrease significantly.
Edit intent: clarity
Original: Property-based random testing in the style of QuickCheck demands efficient generators for well-distributed random data satisfying complex logical predicates, but writing these generators can be difficult and error prone.
Revised: Property-based random testing a la QuickCheck requires building efficient generators for well-distributed random data satisfying complex logical predicates, but writing these generators can be difficult and error prone.
Edit intent: clarity
Original:  We propose a better alternative: a domain-specific language in which generators are  expressed by decorating predicates with lightweight annotations to control both the distribution of generated values as well as the amount of constraint solving that happens before each variable is instantiated.
Revised:  We propose a domain-specific language in which generators are expressed by decorating predicates with lightweight annotations to control both the distribution of generated values as well as the amount of constraint solving that happens before each variable is instantiated.
Edit intent: clarity
Original:  We propose a better alternative: a domain-specific language in which generators are  expressed by decorating predicates with lightweight annotations to control both the distribution of generated values as well as the amount of constraint solving that happens before each variable is instantiated.
Revised:  We propose a better alternative: a domain-specific language in which generators are conveniently expressed by decorating predicates with lightweight annotations to control both the distribution of generated values as well as the amount of constraint solving that happens before each variable is instantiated.
Edit intent: clarity