wanyu/IteraTeR_v2 huggingface dataset:
Original: We learn a latent space for easy capture, semantic editing, consistent interpolation, and efficient reproduction of visual material appearance.
Revised: We learn a latent space for easy capture, consistent interpolation, and efficient reproduction of visual material appearance.
Edit intent: clarity
Original:  When users provide a photo of a stationary natural material captured under flash light illumination, it is converted in milliseconds into a latent material code.
Revised:  When users provide a photo of a stationary natural material captured under flashlight illumination, first it is converted in milliseconds into a latent material code.
Edit intent: coherence
Original:  When users provide a photo of a stationary natural material captured under flash light illumination, it is converted in milliseconds into a latent material code.
Revised:  When users provide a photo of a stationary natural material captured under flash light illumination, it is converted into a latent material code.
Edit intent: clarity
Original:  In a second step, conditioned on the material code, our method , again in milliseconds, produces an infinite and diverse spatial field of BRDF model parameters (diffuse albedo, specular albedo , roughness, normals) that allows rendering in complex scenes and illuminations, matching the appearance of the input picture .
Revised:  Then, in the second step, conditioned on the material code, our method , again in milliseconds, produces an infinite and diverse spatial field of BRDF model parameters (diffuse albedo, specular albedo , roughness, normals) that allows rendering in complex scenes and illuminations, matching the appearance of the input picture .
Edit intent: coherence
Original:  In a second step, conditioned on the material code, our method , again in milliseconds, produces an infinite and diverse spatial field of BRDF model parameters (diffuse albedo, specular albedo , roughness, normals) that allows rendering in complex scenes and illuminations, matching the appearance of the input picture .
Revised:  In a second step, conditioned on the material code, our method produces an infinite and diverse spatial field of BRDF model parameters (diffuse albedo, specular albedo , roughness, normals) that allows rendering in complex scenes and illuminations, matching the appearance of the input picture .
Edit intent: clarity
Original:  In a second step, conditioned on the material code, our method , again in milliseconds, produces an infinite and diverse spatial field of BRDF model parameters (diffuse albedo, specular albedo , roughness, normals) that allows rendering in complex scenes and illuminations, matching the appearance of the input picture .
Revised:  In a second step, conditioned on the material code, our method , again in milliseconds, produces an infinite and diverse spatial field of BRDF model parameters (diffuse albedo, normals , roughness, normals) that allows rendering in complex scenes and illuminations, matching the appearance of the input picture .
Edit intent: clarity
Original:  In a second step, conditioned on the material code, our method , again in milliseconds, produces an infinite and diverse spatial field of BRDF model parameters (diffuse albedo, specular albedo , roughness, normals) that allows rendering in complex scenes and illuminations, matching the appearance of the input picture .
Revised:  In a second step, conditioned on the material code, our method , again in milliseconds, produces an infinite and diverse spatial field of BRDF model parameters (diffuse albedo, specular albedo , roughness, specular albedo) that subsequently allows rendering in complex scenes and illuminations, matching the appearance of the input picture .
Edit intent: clarity
Original:  In a second step, conditioned on the material code, our method , again in milliseconds, produces an infinite and diverse spatial field of BRDF model parameters (diffuse albedo, specular albedo , roughness, normals) that allows rendering in complex scenes and illuminations, matching the appearance of the input picture .
Revised:  In a second step, conditioned on the material code, our method , again in milliseconds, produces an infinite and diverse spatial field of BRDF model parameters (diffuse albedo, specular albedo , roughness, normals) that allows rendering in complex scenes and illuminations, matching the appearance of the input photograph .
Edit intent: clarity
Original:  A user study confirms that the semantics of the latent material space agree with user expectations and compares our approach favorably to previous work  .
Revised:  A user study compares our approach favorably to previous work .
Edit intent: clarity
Original: We study the NP-hard Fair Connected Districting problem: Partition a vertex-colored graph into k connected components (subsequently referred to as districts) so that in each district the most frequent color occurs at most a given number of times more often than the second most frequent color.
Revised: We study the NP-hard Fair Connected Districting problem: Partition a vertex-colored graph into k connected components (subsequently referred to as districts) so that in every district the most frequent color occurs at most a given number of times more often than the second most frequent color.
Edit intent: fluency
Original:  We conduct a fine-grained analysis of the (parameterized) computational complexity of Fair Connected Districting , proving that it is polynomial-time solvable on paths, cycles, stars, caterpillars, and cliques, but already becomes NP-hard on trees.
Revised:  We conduct a fine-grained analysis of the (parameterized) computational complexity of Fair Connected Districting . In particular, we prove that it is polynomial-time solvable on paths, cycles, stars, caterpillars, and cliques, but already becomes NP-hard on trees.
Edit intent: coherence
Original:  We conduct a fine-grained analysis of the (parameterized) computational complexity of Fair Connected Districting , proving that it is polynomial-time solvable on paths, cycles, stars, caterpillars, and cliques, but already becomes NP-hard on trees.
Revised:  We conduct a fine-grained analysis of the (parameterized) computational complexity of Fair Connected Districting , proving that it is polynomial-time solvable on paths, cycles, stars, and caterpillars, but already becomes NP-hard on trees.
Edit intent: clarity
Original:  We obtain a rich and diverse, close to complete picture of the corresponding parameterized complexity landscape (that is, a classification along the complexity classes FPT, XP, W[1]-hardness, and para-NP-hardness) . Doing so, we draw a fine line between tractability and intractability and identify structural properties of the underlying graph that make Fair Connected Districting computationally hard .
Revised:  We obtain a rich and diverse, close to complete picture of the corresponding parameterized complexity landscape (that is, a classification along the complexity classes FPT, XP, W[1]-hardness, and para-NP-hardness) .
Edit intent: coherence
Original:  Designing housing policies is further difficult giving the heterogeneous characteristics of properties themselves and the intricacy of housing markets and the spatial context of cities.
Revised:  Designing housing policies is further difficult given the heterogeneous characteristics of properties themselves and the intricacy of housing markets and the spatial context of cities.
Edit intent: fluency
Original:  PS2 is a computer simulation that relies on empirically detailed spatial data to model real estate, along with labor, credit  and goods and services markets.
Revised:  PS2 is a computer simulation that relies on empirically detailed spatial data to model real estate, along with labor, credit , and goods and services markets.
Edit intent: fluency
Original:  PS2 is applied to a comparison among three competing municipal housing policies aimed at alleviating poverty: (a) property acquisition and distribution, (b) rental vouchers  and (c) monetary aid.
Revised:  PS2 is applied to a comparison among three competing municipal housing policies aimed at alleviating poverty: (a) property acquisition and distribution, (b) rental vouchers , and (c) monetary aid.
Edit intent: fluency
Original:  Designing housing policies is further difficult given the heterogeneous characteristics of properties themselves and the intricacy of housing markets and the spatial context of cities.
Revised:  Designing public policies is further difficult given the heterogeneous characteristics of properties themselves and the intricacy of housing markets and the spatial context of cities.
Edit intent: clarity
Original:  Interaction among workers, firms, a bank, households and municipalities follow the literature benchmarks to integrate economic, spatial and transport literature . PS2 is applied to a comparison among three competing municipal housing policies aimed at  alleviating poverty: (a) property acquisition and distribution , (b) rental vouchers, and (c) monetary aid.
Revised:  Interaction among workers, firms, a bank, households and municipalities follow the literature benchmarks to integrate economic, spatial and transport scholarship . PS2 is applied to a comparison among three competing municipal housing policies aimed at alleviating poverty: (a) property acquisition and distribution , (b) rental vouchers, and (c) monetary aid.
Edit intent: fluency
Original:  Interaction among workers, firms, a bank, households and municipalities follow the literature benchmarks to integrate economic, spatial and transport literature . PS2 is applied to a comparison among three competing municipal housing policies aimed at  alleviating poverty: (a) property acquisition and distribution , (b) rental vouchers, and (c) monetary aid.
Revised:  Interaction among workers, firms, a bank, households and municipalities follow the literature benchmarks to integrate economic, spatial and transport literature . PS2 is applied to a comparison among three competing public policies aimed at alleviating poverty: (a) property acquisition and distribution , (b) rental vouchers, and (c) monetary aid.
Edit intent: clarity
Original: Consider the hypergraph whose vertex set is a family of n lines in general position in the plane, and whose hyperedges are induced by intersections with a finite family of pseudo-discs.
Revised: Consider the hypergraph whose vertex set is a family of n lines in general position in the plane, and whose hyperedges are induced by intersections with a family of pseudo-discs.
Edit intent: clarity
Original: In this work we present  multi-derivative  implicit-explicit (IMEX)  Runge--Kutta schemes.
Revised: In this work we present multi-derivative implicit-explicit (IMEX) multi-derivative Runge--Kutta schemes.
Edit intent: fluency
Original:  In this work, we we derive exact expressions for the expected SFS of a cell population that evolves according to a stochastic branching process, first for cells with an infinite line of descent and then for the total population, evaluated either at a fixed time (fixed-time spectrum) or at the stochastic time at which the population reaches a certain size (fixed-size spectrum).
Revised:  In this work, we derive exact expressions for the expected SFS of a cell population that evolves according to a stochastic branching process, first for cells with an infinite line of descent and then for the total population, evaluated either at a fixed time (fixed-time spectrum) or at the stochastic time at which the population reaches a certain size (fixed-size spectrum).
Edit intent: fluency
Original:  We use this insight to propose a simple estimator for the ratio between the rate of cell death and cell birth, that we show to accurately recover the true ratio from synthetic single-cell sequencing data .
Revised:  We show that this insight can in principle be used to estimate the ratio between the rate of cell death and cell birth, that we show to accurately recover the true ratio from synthetic single-cell sequencing data .
Edit intent: clarity
Original:  While successive contacts  are independent, the probability of repeat contact between individuals decreases with time after a previous contact.
Revised:  While successive contacts between individuals are independent, the probability of repeat contact between individuals decreases with time after a previous contact.
Edit intent: fluency
Original:  While successive contacts  are independent, the probability of repeat contact between individuals decreases with time after a previous contact.
Revised:  While successive contacts are independent, the probability of repeat contact decreases with time after a previous contact.
Edit intent: clarity
Original: In recent years, graph neural networks (GNNs) have gained increasing attention, as they possess  excellent capability of processing graph-related problems.
Revised: In recent years, graph neural networks (GNNs) have gained increasing attention, as they possess the excellent capability of processing graph-related problems.
Edit intent: fluency
Original:  Many approaches have been proposed for HPO  which aims to identify promising hyperparameters efficiently.
Revised:  Many approaches have been proposed for HPO , which aims to identify promising hyperparameters efficiently.
Edit intent: fluency
Original:  In particular,  genetic algorithm (GA) for HPO has been explored, which treats GNNs as a black-box model, of which only the outputs can be observed given a set of hyperparameters.
Revised:  In particular, the genetic algorithm (GA) for HPO has been explored, which treats GNNs as a black-box model, of which only the outputs can be observed given a set of hyperparameters.
Edit intent: fluency
Original:  However, because GNN models are extremely sophisticated and the evaluations of hyperparameters on GNNs are expensive, GA requires advanced techniques to balance the exploration and exploitation of the search and make the optimisation more effective given limited computational resources.
Revised:  However, because GNN models are sophisticated and the evaluations of hyperparameters on GNNs are expensive, GA requires advanced techniques to balance the exploration and exploitation of the search and make the optimisation more effective given limited computational resources.
Edit intent: coherence
Original:  Meanwhile, we reviewed the recent HPO works which gives the room to the idea of tree-structure to develop, and we hope our approach can further improve these HPO methods in the future.
Revised:  Meanwhile, we reviewed the recent HPO works , which gives room for the idea of tree-structure to develop, and we hope our approach can further improve these HPO methods in the future.
Edit intent: fluency
Original: With the widespread deployment of large-scale prediction systems in high-stakes domains, e.g., face recognition, criminal justice, etc., disparity on prediction accuracy between different demographic subgroups has called for fundamental understanding on the source of such disparity and algorithmic intervention to mitigate it.
Revised: With the widespread deployment of large-scale prediction systems in high-stakes domains, e.g., face recognition, criminal justice, etc., disparity in prediction accuracy between different demographic subgroups has called for fundamental understanding on the source of such disparity and algorithmic intervention to mitigate it.
Edit intent: clarity
Original:  The Registration User Interface (RUI) was developed to allow stakeholders in the Human Biomolecular Atlas Program (HuBMAP) to register tissue blocks by size, position, and orientation .
Revised:  The Registration User Interface (RUI) was developed to allow stakeholders in the Human Biomolecular Atlas Program (HuBMAP) to register tissue blocks , i.e., to record the size, position, and orientation .
Edit intent: coherence
Original:  The remaining setups are both virtual reality (VR) versions of the RUI: VR Tabletop, where users sit at a physical desk  ;
Revised:  The remaining setups are both virtual reality (VR) versions of the RUI: VR Tabletop, where users sit at a physical desk which is replicated in virtual space ;
Edit intent: clarity
Original:  We found that while VR Tabletop and VR Standup users are about three times as fast and about a third more accurate in terms of rotation than 2D Desktop users  , there are no significant differences  for position accuracy .
Revised:  While VR Tabletop and VR Standup users are about three times as fast and about a third more accurate in terms of rotation than 2D Desktop users , there are no significant differences for position accuracy .
Edit intent: coherence
Original:  We found that while VR Tabletop and VR Standup users are about three times as fast and about a third more accurate in terms of rotation than 2D Desktop users  , there are no significant differences  for position accuracy .
Revised:  We found that while VR Tabletop and VR Standup users are about three times as fast and about a third more accurate in terms of rotation than 2D Desktop users , there are no significant differences between the three setups for position accuracy .
Edit intent: clarity
Original:  Another consensus algorithm, HotStuff, implemented by Facebook  Libra project, has achieved linear complexity of the authenticator.
Revised:  Another consensus algorithm, HotStuff, implemented by Facebook 's Libra project, has achieved linear complexity of the authenticator.
Edit intent: fluency
Original: We analyse the complexity of learning first-order definable concepts in a model-theoretic framework for supervised learning introduced by (Grohe and Tur\'an, TOCS 2004).
Revised: We analyse the complexity of learning first-order queries in a model-theoretic framework for supervised learning introduced by (Grohe and Tur\'an, TOCS 2004).
Edit intent: clarity
Original:  We obtain a hardness result showing that exactly learning first-order definable concepts is at least as hard as the corresponding model-checking problem, which implies that on general structures it is hard for the parameterized complexity class AW[*].
Revised:  We obtain a hardness result , showing that learning first-order definable concepts is at least as hard as the corresponding model-checking problem, which implies that on general structures it is hard for the parameterized complexity class AW[*].
Edit intent: clarity
Original:  We obtain a hardness result showing that exactly learning first-order definable concepts is at least as hard as the corresponding model-checking problem, which implies that on general structures it is hard for the parameterized complexity class AW[*].
Revised:  We obtain a hardness result showing that exactly learning first-order queries is at least as hard as the corresponding model-checking problem, which implies that on general structures it is hard for the parameterized complexity class AW[*].
Edit intent: clarity
Original:  Our  main contribution is a fixed-parameter tractable agnostic PAC learning algorithm for first-order definable concepts over effectively nowhere dense background structures  .
Revised:  Our main contribution is a fixed-parameter tractable agnostic PAC learning algorithm for first-order definable concepts over effectively nowhere dense background structures ) .
Edit intent: fluency
Original:  We use a null model and several statistical tests to identify meaningful coordination behavior .
Revised:  Our findings suggest the need to develop a system that monitors the low-quality URLs shared in times of crisis .
Edit intent: clarity
Original:  We conducted a six-participant pre-user study for exploring the feasibility of our two vrCAPTCHAs and traditional CAPTCHAs in VR.
Revised:  We conducted a user study with six participants for exploring the feasibility of our two vrCAPTCHAs and traditional CAPTCHAs in VR.
Edit intent: clarity
Original:  Finally, we believe that our two vrCAPTCHAs can be an inspiration for the further design of CAPTCHAs in VR.
Revised:  We believe that our two vrCAPTCHAs can be an inspiration for the further design of CAPTCHAs in VR.
Edit intent: fluency
Original: Sketching is a dimensionality reduction technique where one compresses a matrix by linear combinations that are typically chosen at random.
Revised: Sketching is a dimensionality reduction technique where one compresses a matrix by linear combinations that are chosen at random.
Edit intent: clarity
Original:  We show empirically that learned sketches, compared with their "non-learned" counterparts,  improve the approximation accuracy for important problems, including LASSO , SVM, and matrix estimation with nuclear norm constraints .
Revised:  We show empirically that learned sketches, compared with their "non-learned" counterparts, do improve the approximation accuracy for important problems, including LASSO , SVM, and matrix estimation with nuclear norm constraints .
Edit intent: clarity
Original:  We show empirically that learned sketches, compared with their "non-learned" counterparts,  improve the approximation accuracy for important problems, including LASSO , SVM, and matrix estimation with nuclear norm constraints .
Revised:  We show empirically that learned sketches, compared with their "non-learned" counterparts, improve the approximation accuracy for important problems, including LASSO and matrix estimation with nuclear norm constraints .
Edit intent: clarity
Original: Mobile health (mHealth) apps such as menstrual trackers provide a rich source of self-tracked health observations that can be leveraged for statistical modeling .
Revised: Mobile health (mHealth) apps such as menstrual trackers provide a rich source of self-tracked health observations that can be leveraged for health-relevant research .
Edit intent: clarity
Original:  However, such data streams are notoriously unreliable since they hinge on user adherence to the app.
Revised:  However, such data streams have questionable reliability since they hinge on user adherence to the app.
Edit intent: clarity
Original:  Thus , it is crucial for machine learning models to account for self-tracking artifacts like skipped self-tracking.
Revised:  Therefore , it is crucial for machine learning models to account for self-tracking artifacts like skipped self-tracking.
Edit intent: fluency
Original:  Thus , it is crucial for machine learning models to account for self-tracking artifacts like skipped self-tracking.
Revised:  Thus , it is crucial for researchers to separate true behavior from self-tracking artifacts like skipped self-tracking.
Edit intent: clarity
Original:  In this abstract , we propose and evaluate a hierarchical, generative model for predicting next cycle length based on previously tracked cycle lengths that accounts explicitly for the possibility of users forgetting to track their period.
Revised:  In this abstract , we propose and evaluate a hierarchical, generative model for predicting next cycle length based on previously-tracked cycle lengths that accounts explicitly for the possibility of users forgetting to track their period.
Edit intent: fluency
Original:  In this abstract , we propose and evaluate a hierarchical, generative model for predicting next cycle length based on previously tracked cycle lengths that accounts explicitly for the possibility of users forgetting to track their period.
Revised:  In this abstract , we propose and evaluate a hierarchical, generative model for predicting next cycle length based on previously tracked cycle lengths that accounts explicitly for the possibility of users skipping tracking their period.
Edit intent: clarity
Original:  2) as a generative model, predictions can be updated online as a given cycle evolves  ;
Revised:  2) because it is a generative model, predictions can be updated online as a given cycle evolves ;
Edit intent: coherence
Original:  However, data scientists often pay attention only to the code, and neglect creating or updating their documentation during quick iterations , which leads to challenges in sharing their notebooks with others and future selves .
Revised:  However, data scientists often pay attention only to the code, and neglect creating or updating their documentation during quick iterations .
Edit intent: coherence