wanyu/IteraTeR_v2 huggingface dataset:
Original:  Comprehensive experiments conducted on public datasets demonstrate the effectiveness of the proposed method over the state-of-art methods . Notably, our model gains substantial improvements when only a few labeled samples are provided  .
Revised:  Comprehensive experiments conducted on public datasets demonstrate the effectiveness of the proposed method over the state-of-art methods . Notably, our model gains substantial improvements when only a few labeled samples are provided , our model gains substantial improvements .
Edit intent: coherence
Original:  We achieve sub-linear memory by combining advances in locality sensitive hashing (LSH) based estimation, especially the recently-published ACE algorithm, with compressed sensing and heavy hitter techniques.
Revised:  We achieve sub-linear memory by combining advances in locality sensitive hashing (LSH) -based estimators with compressed sensing and heavy hitter techniques.
Edit intent: clarity
Original:  in particular, our analysis sheds new light on the memory-accuracy tradeoff in the near-neighbor search setting and the role of sparsity in compressed sensing , which could be of independent interest.
Revised:  in particular, our analysis sheds new light on the memory-accuracy tradeoff for near-neighbor search setting and the role of sparsity in compressed sensing , which could be of independent interest.
Edit intent: fluency
Original: We present the first sublinear memory sketch which can be queried to find the v nearest neighbors in a dataset.
Revised: We present the first sublinear memory sketch that can be queried to find the v nearest neighbors in a dataset.
Edit intent: fluency
Original: We present the first sublinear memory sketch which can be queried to find the v nearest neighbors in a dataset.
Revised: We present the first sublinear memory sketch which can be queried to find the nearest neighbors in a dataset.
Edit intent: fluency
Original:  We achieve data-dependent sublinear space by combining recent advances in locality sensitive hashing (LSH)-based estimators with compressed sensing.
Revised:  We achieve data-dependent sublinear space by combining recent advances in locality sensitive hash (LSH)-based estimators with compressed sensing.
Edit intent: fluency
Original:  The proposed algorithm assumes that G have potential forbidden minors that prevent a potential hamiltonian sequence P from being a hamiltonian sequence.
Revised:  The proposed algorithm assumes that G has potential forbidden minors that prevent a potential hamiltonian sequence P from being a hamiltonian sequence.
Edit intent: fluency
Original:  In first phrase, the algorithm pass through G constructing a potential hamiltonian sequence P with the aim of degenerating these potential forbidden minors.
Revised:  In first phrase, the algorithm passes through G constructing a potential hamiltonian sequence P with the aim of degenerating these potential forbidden minors.
Edit intent: fluency
Original:  The algorithm, in turn, try to reconstruct P in second phrase by using a goal-oriented approach.
Revised:  The algorithm, in turn, tries to reconstruct P in second phrase by using a goal-oriented approach.
Edit intent: fluency
Original:  In first phrase, the algorithm passes through G constructing a potential hamiltonian sequence P  with the aim of degenerating these potential forbidden minors.
Revised:  In first phrase, the algorithm passes through G in order to construct a potential hamiltonian sequence P with the aim of degenerating these potential forbidden minors.
Edit intent: clarity
Original:  We study four properties:  closed, free, non-derivable and totally shattereditemsets, demonstrating how we can compute the robustness analytically without actually sampling the data.
Revised:  We study four properties: closed, free, non-derivable or totally shattered, and demonstrate how to compute the robustness analytically without actually sampling the data.
Edit intent: coherence
Original:  Our concept of robustness has many advantages: Unlike statistical approaches for reducing patterns, we do not assume a null hypothesis or any noise model and the patterns reported are simply a subset of all patterns with this property as opposed to approximate patterns for which the property does not really hold .
Revised:  Our concept of robustness has many advantages: Unlike statistical approaches for reducing patterns, we do not assume a null hypothesis or any noise model and the patterns reported are simply a subset of the patterns with this property as opposed to approximate patterns for which the property does not really hold .
Edit intent: clarity
Original:  Our concept of robustness has many advantages: Unlike statistical approaches for reducing patterns, we do not assume a null hypothesis or any noise model and the patterns reported are simply a subset of all patterns with this property as opposed to approximate patterns for which the property does not really hold .
Revised:  Our concept of robustness has many advantages: Unlike statistical approaches for reducing patterns, we do not assume a null hypothesis or any noise model and the patterns reported are simply a subset of all patterns with this property .
Edit intent: coherence
Original:  and interesting influential patterns with respect to the `location', `type', and `duration' of long-term entities (e.g., a major construction --> more congestions ).
Revised:  and interesting influential patterns with respect to the "location", "duration", and "type" of long-term entities (e.g., a major construction --> more congestions ).
Edit intent: fluency
Original:  and interesting influential patterns with respect to the `location', `type', and `duration' of long-term entities (e.g., a major construction --> more congestions ).
Revised:  and interesting influential patterns with respect to the `location', `type', and `duration' of long-term entities (e.g., a major construction --> more traffic incidents ).
Edit intent: clarity
Original:  These patterns and the categorization of the states provide useful insights on the driving habits and infrastructure characteristics of different regions in the US, and could be of significant value for applications such as urban planing and personalized insurance.
Revised:  These patterns and the categorization of the states provide useful insights on the driving habits and infrastructure characteristics of different regions in the US, and could be of significant value for applications such as urban planning and personalized insurance.
Edit intent: fluency
Original: The eikonal equation is used to model high-frequency wave propagation and solve a variety of applied problems in computational science.
Edit intent: coherence
Original:  We present a family of fast and accurate Dijkstra-like solvers for the eikonal equation and factored eikonal equation , which compute solutions on a regular grid by solving local variational minimization problems.
Revised:  We present a family of fast and accurate Dijkstra-like solvers for the eikonal equation and factored eikonal equation which compute solutions on a regular grid by solving local variational minimization problems.
Edit intent: fluency
Original:  A library that implements the proposed solvers is available online .
Revised:  A library that implements the proposed solvers is available on GitHub .
Edit intent: clarity
Original: Humans use language to collectively execute complex strategies in addition to using it as a referential tool for referring to physical entities.
Revised: Humans use language to collectively execute abstract strategies besides using it as a referential tool for referring to physical entities.
Edit intent: clarity
Original: Humans use language to collectively execute complex strategies in addition to using it as a referential tool for referring to physical entities.
Revised: Humans use language to collectively execute complex strategies in addition to using it as a referential tool for identifying physical entities.
Edit intent: clarity
Original:  While existing approaches that study the emergence of language in settings where the language mainly acts as a referential tool , in this paper, we study the role of emergent languages in discovering and implementing strategies in a multi-agent setting.
Revised:  While existing approaches that study the emergence of language in settings where the language mainly acts as a referential tool , in this paper, we study their role in discovering and implementing strategies in a multi-agent setting.
Edit intent: clarity
Original:  We formulate the problem as a voting game , where two candidate agents are contesting in an election and their goal is to convince the population members (other agents) in the network to vote for them by sending them messages .
Revised:  We formulate the problem using a voting game , where two candidate agents are contesting in an election and their goal is to convince the population members (other agents) in the network to vote for them by sending them messages .
Edit intent: fluency
Original:  We formulate the problem as a voting game , where two candidate agents are contesting in an election and their goal is to convince the population members (other agents) in the network to vote for them by sending them messages .
Revised:  We formulate the problem as a voting game where two candidate agents are contesting in an election and their goal is to convince the population members (other agents) in the network to vote for them by sending them messages .
Edit intent: fluency
Original:  We formulate the problem as a voting game , where two candidate agents are contesting in an election and their goal is to convince the population members (other agents) in the network to vote for them by sending them messages .
Revised:  We formulate the problem as a voting game , where two candidate agents contest in an election and their goal is to convince the population members (other agents) in the network to vote for them by sending them messages .
Edit intent: clarity
Original:  We formulate the problem as a voting game , where two candidate agents are contesting in an election and their goal is to convince the population members (other agents) in the network to vote for them by sending them messages .
Revised:  We formulate the problem as a voting game , where two candidate agents are contesting in an election with the goal of convincing population members (other agents) in the network to vote for them by sending them messages .
Edit intent: clarity
Original:  To the best of our knowledge this is the first work that explores emergence of language for discovering and implementing strategies in a setting where agents are connected via an underlying network.
Revised:  To the best of our knowledge , we are the first to explore emergence of communication for discovering and implementing strategies in a setting where agents are connected via an underlying network.
Edit intent: clarity
Original:  To the best of our knowledge this is the first work that explores emergence of language for discovering and implementing strategies in a setting where agents are connected via an underlying network.
Revised:  To the best of our knowledge this is the first work that explores emergence of language for discovering and implementing strategies in a setting where agents communicate over a network.
Edit intent: clarity
Original: In this paper, we study the dualization in distributive lattices, a generalization of the well known hypergraph dualization problem.
Revised: In this paper, we study the dualization in distributive lattices, a generalization of the well-known hypergraph dualization problem.
Edit intent: fluency
Original:  We give a characterization of the complexity of the problem under various combined restrictions on graph classes and posets , including bipartite, split  and co-bipartite graphs, and variants of neighborhood inclusion posets.
Revised:  We give a characterization of the complexity of the problem under various combined restrictions on graph classes and poset types , including bipartite, split and co-bipartite graphs, and variants of neighborhood inclusion posets.
Edit intent: clarity
Original:  We give a characterization of the complexity of the problem under various combined restrictions on graph classes and posets , including bipartite, split  and co-bipartite graphs, and variants of neighborhood inclusion posets.
Revised:  We give a characterization of the complexity of the problem under various combined restrictions on graph classes and posets , including bipartite, split , and co-bipartite graphs, and variants of neighborhood inclusion posets.
Edit intent: fluency
Original:  In particular, we show that while the enumeration of minimal dominating sets is possible with linear delay in split graphs, the problem  gets as hard as for general graphs in distributive lattices .
Revised:  We for example show that while the enumeration of minimal dominating sets is possible with linear delay in split graphs, the problem gets as hard as for general graphs in distributive lattices .
Edit intent: clarity
Original:  More surprisingly, this result holds even when the poset coding the lattice is only comparing vertices of included neighborhoods in the graph.
Revised:  More surprisingly, this result holds even when the poset is only comparing vertices of included neighborhoods in the graph.
Edit intent: clarity
Original:  If both the poset and the graph  are sufficiently restricted, we show that the dualization becomes tractable relying on existing algorithms from the literature.
Revised:  If both the poset and the graph are sufficiently restricted, we show that the dualization is tractable relying on existing algorithms from the literature.
Edit intent: clarity
Original: Having in mind the modelling of marble degradation under chemical pollutants, e.g.  the sulfation process, we consider governing nonlinear diffusion equations and their numerical approximation.
Revised: Having in mind the modelling of marble degradation under chemical pollutants, e.g. ~ the sulfation process, we consider governing nonlinear diffusion equations and their numerical approximation.
Edit intent: fluency
Original: The space domain of a computation is the pristine marble object and, in order to accurately discretize it while maintaining the simplicity of finite difference discretizations, the domain is implicitly defined using a level-set approach . A uniform Cartesian grid is laid over a box containing the domain, but the solution is defined and updated only in the grid nodes that lie inside the domain, the level-set being employed to select them and to impose accurately the boundary conditions.
Revised: The space domain of a computation is the pristine marble object . In order to accurately discretize it while maintaining the simplicity of finite difference discretizations, the domain is implicitly defined using a level-set approach . A uniform Cartesian grid is laid over a box containing the domain, but the solution is defined and updated only in the grid nodes that lie inside the domain, the level-set being employed to select them and to impose accurately the boundary conditions.
Edit intent: coherence
Original: The space domain of a computation is the pristine marble object and, in order to accurately discretize it while maintaining the simplicity of finite difference discretizations, the domain is implicitly defined using a level-set approach . A uniform Cartesian grid is laid over a box containing the domain, but the solution is defined and updated only in the grid nodes that lie inside the domain, the level-set being employed to select them and to impose accurately the boundary conditions.
Revised: The space domain of a computation is the pristine marble object and, in order to accurately discretize it while maintaining the simplicity of finite difference discretizations, the domain is described using a level-set approach . A uniform Cartesian grid is laid over a box containing the domain, but the solution is defined and updated only in the grid nodes that lie inside the domain, the level-set being employed to select them and to impose accurately the boundary conditions.
Edit intent: clarity
Original: The space domain of a computation is the pristine marble object and, in order to accurately discretize it while maintaining the simplicity of finite difference discretizations, the domain is implicitly defined using a level-set approach . A uniform Cartesian grid is laid over a box containing the domain, but the solution is defined and updated only in the grid nodes that lie inside the domain, the level-set being employed to select them and to impose accurately the boundary conditions.
Revised: The space domain of a computation is the pristine marble object and, in order to accurately discretize it while maintaining the simplicity of finite difference discretizations, the domain is implicitly defined using a level-set technique . A uniform Cartesian grid is laid over a box containing the domain, but the solution is defined and updated only in the grid nodes that lie inside the domain, the level-set being employed to select them and to impose accurately the boundary conditions.
Edit intent: clarity
Original:  We use a Crank-Nicolson  in time, while for the space variables the discretization is performed by a standard Finite-Difference scheme for grid points inside the domain and by a ghost-cell technique on the ghost points (by using boundary conditions).
Revised:  We use a Crank-Nicolson scheme in time, while for the space variables the discretization is performed by a standard Finite-Difference scheme for grid points inside the domain and by a ghost-cell technique on the ghost points (by using boundary conditions).
Edit intent: fluency
Original: Zealots are the nodes in a social network who do not change their opinions under social pressure, and have been considered crucial in the study of opinion dynamics on complex networks.
Revised: Zealots are the vertices in a social network who do not change their opinions under social pressure, and have been considered crucial in the study of opinion dynamics on complex networks.
Edit intent: clarity
Original: Zealots are the nodes in a social network who do not change their opinions under social pressure, and have been considered crucial in the study of opinion dynamics on complex networks.
Revised: Zealots are the nodes in a social network who do not change their opinions under social pressure, and are crucial to the study of opinion dynamics on complex networks.
Edit intent: clarity
Original:  Here we show that whether or not their presence affects the social polarization depends sensitively on their topological characteristics, and on the initial conditions of the dynamics .
Revised:  In this paper, we study the effect of zealots on the dynamics .
Edit intent: clarity
Original:  To this end, we first quantify the amount of polarization when nodes of the network can exists in two opposite states.
Revised:  To this end, we first quantify the amount of polarization in the network when vertices can exists in two opposite states.
Edit intent: clarity
Original:  Whether the goal is to select the most informative result for analysis, or  decide which mining approach will  likely provide the most novel insight, it is essential that we can tell how different the information is that two results provide.
Revised:  Whether the goal is to select the most informative result for analysis, or to decide which mining approach will likely provide the most novel insight, it is essential that we can tell how different the information is that two results provide.
Edit intent: fluency
Original:  Whether the goal is to select the most informative result for analysis, or  decide which mining approach will  likely provide the most novel insight, it is essential that we can tell how different the information is that two results provide.
Revised:  Whether the goal is to select the most informative result for analysis, or decide which mining approach will most likely provide the most novel insight, it is essential that we can tell how different the information is that two results provide.
Edit intent: fluency
Original:  Whether the goal is to select the most informative result for analysis, or  decide which mining approach will  likely provide the most novel insight, it is essential that we can tell how different the information is that two results provide.
Revised:  Whether the goal is to select the most informative result for analysis, or decide which mining approach will likely provide the most novel insight, it is essential that we can tell how different the information is that different results by possibly different methods provide.
Edit intent: clarity
Original:  As an application, we show that it can also be used to identify which parts of results best redescribe other results.
Revised:  As an application, we show that our measure can also be used to identify which parts of results best redescribe other results.
Edit intent: clarity
Original:   Experimental evaluation shows our measure gives meaningful results, correctly identifies methods that are similar in nature, and automatically provides sound redescriptions of results  .
Revised:  Experimental evaluation shows our measure gives meaningful results, correctly identifies methods that are similar in nature, automatically provides sound redescriptions of results .
Edit intent: coherence
Original: The persistence diagram is an increasingly useful tool arising from the field of Topological Data Analysis .
Revised: The persistence diagram is an increasingly useful tool from Topological Data Analysis .
Edit intent: clarity
Original:  However, using these diagrams in conjunction with machine learning techniques requires some mathematical finesse.
Revised:  However, using these diagrams in conjunction with machine learning techniques requires mathematical finesse.
Edit intent: clarity
Original:  In this paper, we describe a mathematical framework for featurizing the persistence diagram space using template functions.
Revised:  In this paper, we describe a mathematical framework for featurization using template functions.
Edit intent: coherence
Original:  These functions are general as they are only required to be continuous , have a compact support, and separate points .
Revised:  These functions are general as they are only required to be continuous and compactly supported .
Edit intent: clarity
Original:  We discuss two example realizationsof these functions : tent functions and Chybeyshev interpolating polynomials.
Revised:  We discuss two realizations : tent functions and Chybeyshev interpolating polynomials.
Edit intent: clarity
Original:  We then combine the resulting features with machine learning algorithms to perform supervised classification and regression on several example data sets, including manifold data, shape data , and an embedded time series from a Rossler system.
Revised:  We then combine the resulting features with classification and regression on several example data sets, including manifold data, shape data , and an embedded time series from a Rossler system.
Edit intent: clarity
Original:  We then combine the resulting features with machine learning algorithms to perform supervised classification and regression on several example data sets, including manifold data, shape data , and an embedded time series from a Rossler system.
Revised:  We then combine the resulting features with machine learning algorithms to perform supervised classification and regression algorithms on several examples including shape data and the Rossler system.
Edit intent: clarity
Original:  Our results show that the template function approach yields high accuracy rates that match and often exceed the results of existing methods for featurizing persistence diagrams .
Revised:  Our results show that using template functions yields high accuracy rates that match and often exceed the results of existing methods for featurizing persistence diagrams .
Edit intent: clarity