wanyu/IteraTeR_full_sent huggingface dataset:
Original:  We discuss how the results could inform the design of multimodal representations aligned with the data and analytical tasks, and present a research roadmap on the expansion of the taxonomy to deepen our understanding on the combination of visualizations and natural language.
Revised:  We discuss how the results could inform the design of multimodal representations aligned with the data and analytical tasks, and present a research roadmap to deepen the understanding about visualizations and natural language.
Edit intent: clarity
Original:  Unlike existing studies that focus on the equivalent Black-Scholes (BS) volatility, we instead derive the equivalent volatility under the constant-elasticity-of-variance (CEV) model, which is the limit of the SABR model when the volatility of volatility approaches 0. Numerical examples demonstrate the accuracy of the CEV volatility approximation for a wide range of parameters.
Revised:  Unlike existing studies that focus on the equivalent Black-Scholes (BS) volatility, we instead derive the equivalent constant-elasticity-of-variance (CEV) model, which is the limit of the SABR model when the volatility of volatility approaches 0. Numerical examples demonstrate the accuracy of the CEV volatility approximation for a wide range of parameters.
Edit intent: clarity
Original:  Unlike existing studies that focus on the equivalent Black-Scholes (BS) volatility, we instead derive the equivalent volatility under the constant-elasticity-of-variance (CEV) model, which is the limit of the SABR model when the volatility of volatility approaches 0. Numerical examples demonstrate the accuracy of the CEV volatility approximation for a wide range of parameters.
Revised:  Unlike existing studies that focus on the equivalent Black-Scholes (BS) volatility, we instead derive the equivalent volatility under the constant-elasticity-of-variance (CEV) volatility. Our approach effectively reduces the approximation error in a way similar to the control variate method because the CEV model is the zero vol-of-vol limit of the SABR model when the volatility of volatility approaches 0. Numerical examples demonstrate the accuracy of the CEV volatility approximation for a wide range of parameters.
Edit intent: meaning-changed
Original:  Unlike existing studies that focus on the equivalent Black-Scholes (BS) volatility, we instead derive the equivalent volatility under the constant-elasticity-of-variance (CEV) model, which is the limit of the SABR model when the volatility of volatility approaches 0. Numerical examples demonstrate the accuracy of the CEV volatility approximation for a wide range of parameters. Moreover, in our approach, arbitrage occurs at a lower strike price than in existing BS-based approximations .
Revised:  Unlike existing studies that focus on the equivalent Black-Scholes (BS) volatility, we instead derive the equivalent volatility under the constant-elasticity-of-variance (CEV) model, which is the limit of the SABR model . Moreover, the use of CEV volatility has the effect of imposing an absorbing boundary condition at the origin and thus provides small-time asymptotics for the mass at zero. The numerical results compare favorably with the BS volatility approximations in terms of the approximation accuracy and no-arbitrage region .
Edit intent: coherence
Original: Diffusion magnetic resonance imaging ( MRI ) allows non-invasive exploration of brain structural information, crucial for understanding the human-brain; however, present-day diffusion-based tractography approaches are still lacking in accuracy. Improvement efforts included comparison with anatomical connectivity data, the usage of higher quality data, more sophisticated algorithms and parameters assessment. Despite that, well-known problems such as low sensitivity, dominance of false positives, the accurate reconstruction of long-range connections could not be avoided or minimized.
Revised: Diffusion magnetic resonance imaging ( MRI ) allows non-invasive investigation of whole-brain connectivity, which can potentially help to reveal the brain's global network architecture and abnormalities involved in neurological and mental disorders. However, the reliability of connection inferences from dMRI-based fiber tracking is still debated, due to low sensitivity, dominance of false positives, the accurate reconstruction of long-range connections could not be avoided or minimized.
Edit intent: clarity
Original:  Despite that, well-known problems such as low sensitivity, dominance of false positives, the accurate reconstruction of long-range connections could not be avoided or minimized. Current methods include several parameters, typically tuned in a heuristic way, with settings to increase the sensitivity, without attenuating the overall problem.
Revised:  Despite that, well-known problems such as low sensitivity, dominance of false positives, the accurate reconstruction of long-range connections . Furthermore, parameters of tracking algorithms are typically tuned in a heuristic way, with settings to increase the sensitivity, without attenuating the overall problem.
Edit intent: clarity
Original:  Current methods include several parameters, typically tuned in a heuristic way, with settings to increase the sensitivity, without attenuating the overall problem. We propose a new way to optimize fiber-tracking results by multi-objectives tailored to minimize the current issues.
Revised:  Current methods include several parameters, typically tuned in a heuristic way, which leaves room for manipulation of an intended result. Here we propose a data-driven framework to optimize and validate parameters of dMRI-based fiber-tracking results by multi-objectives tailored to minimize the current issues.
Edit intent: clarity
Original:  We propose a new way to optimize fiber-tracking results by multi-objectives tailored to minimize the current issues. Our approach uses comparison with marmoset fluorescent tracer injection data from the Japan Brain/MINDS to validate and optimize ex-vivo diffusion weighted MRI (DWI)-based global fiber tracking results of the same subject.
Revised:  We propose a new way to optimize fiber-tracking algorithms using neural tracer data as a reference. Japan's Brain/MINDS to validate and optimize ex-vivo diffusion weighted MRI (DWI)-based global fiber tracking results of the same subject.
Edit intent: clarity
Original:  Our approach uses comparison with marmoset fluorescent tracer injection data from the Japan Brain/MINDS to validate and optimize ex-vivo diffusion weighted MRI (DWI)-based global fiber tracking results of the same subject. The approach includes multiple comparisons at a higher-than-DWI resolution standard brain space to evaluate objectives of coverage and passage constraint. The coverage objectives maximize sensitivity while constraining the growth of false positives, promoting the generation of long connections to the projection areas. The passageconstraint minimizes the number of fibers crossing hemispheres outside the commissures .
Revised:  Our approach uses comparison with marmoset fluorescent tracer injection data from the Japan Brain/MINDS Project provides invaluable datasets containing both dMRI and neural tracer data from the same primates. We considered four criteria for goodness of fiber tracking: distance-weighted coverage, true/false positive ratio, projection coincidence, and commissural passage, applied using a multi-objective optimization algorithm .
Edit intent: clarity
Original:  We implemented a  non-dominated sorting genetic algorithm  (NSGA-II) strategy to explore the parameters space. Evolutionary optimization runs for 10 brain samples in parallel while sharing champion settings over samples, encouraging convergence of parameters in a similar locus.
Revised:  We implemented a non-dominated sorting genetic algorithm (NSGA-II) to optimize five major parameters of a global fiber-tracking algorithm over multiple brain samples in parallel while sharing champion settings over samples, encouraging convergence of parameters in a similar locus.
Edit intent: meaning-changed
Original:  Evolutionary optimization runs for 10 brain samples in parallel while sharing champion settings over samples, encouraging convergence of parameters in a similar locus. We evaluate the generalization capability of the optimized parameters on unseen marmoset test data leading to promising results .
Revised:  Evolutionary optimization runs for 10 brain samples in parallel . Using optimized parameters compared to the default parameters, dMRI-based fiber tracking performance was significantly improved, while minimizing false positives and impossible cross-hemisphere connections. Parameters optimized for 10 tracer injection sites showed good generalization capability for other brain samples. These results demonstrate the importance of data-driven adjustment of fiber-tracking algorithms and support the validity of dMRI-based tractography, if appropriate adjustments are employed .
Edit intent: meaning-changed
Original:  On the other hand, for underdamped motion with inertial effects, the intricate competition between self-propulsion , centrifugal and Coriolis forces, in conjunction with the rototactic torque leads to complex dynamical behavior with non-trivial phase space of initial conditions which we reveal by numerical simulations.
Revised:  On the other hand, for underdamped motion with inertial effects, the intricate competition between self-propulsion and inertial forces, in conjunction with the rototactic torque leads to complex dynamical behavior with non-trivial phase space of initial conditions which we reveal by numerical simulations.
Edit intent: clarity
Original:  Considering the games in von  URLenstern mixed extension, we demonstrate that the maximin equilibrium value is precisely the maximin (minimax) value and it coincides with the maximin strategies in two-player zero-sum games.
Revised:  Considering the games in von Neumann and URLenstern mixed extension, we demonstrate that the maximin equilibrium value is precisely the maximin (minimax) value and it coincides with the maximin strategies in two-player zero-sum games.
Edit intent: meaning-changed
Original:  Considering the games in von  URLenstern mixed extension, we demonstrate that the maximin equilibrium value is precisely the maximin (minimax) value and it coincides with the maximin strategies in two-player zero-sum games.
Revised:  Considering the games in von URLenstern mixed extension, we show that maximin equilibrium is a generalization of Nash equilibrium. In addition, we demonstrate that maximin equilibria and Nash equilibria coincide in two-player zero-sum games.
Edit intent: meaning-changed
Original: We introduce a new solution conceptcalled maximin equilibrium which extends von Neumann's maximin strategy idea to n-player non-cooperative games by incorporating common knowledge of 'rationality' of the players. Our rationality assumption is , however, stronger than the one of maximin strategy and weaker than the one of Nash equilibrium. Maximin equilibrium, just like maximin strategies, is a method for evaluating the uncertainty that players are facing by playing the game. We show that maximin equilibrium is invariant under strictly increasing transformations of the payoff functions. Notably, every finite game possesses a maximin equilibrium in pure strategies. Considering the games in von Neumann and URLenstern mixed extension, we show that maximin equilibrium is a generalization of Nash equilibrium . In addition, we demonstrate that maximin equilibria and Nash equilibria coincide in two-player zero-sum games. We propose a refinement of maximin equilibrium called strong maximin equilibrium. Accordingly, we show that for every Nash equilibrium that is not a strong maximin equilibrium there exists a strong maximin equilibrium that Pareto dominates it.
Revised: Cooperation among individuals has been one of the most puzzling phonemena in economics and other social sciences. In this paper, I introduce a novel solution concept, dubbed the optimin criterion, which (to the best of my knowledge) is the first parameter-free concept that can selectively explain the direction of well-established non-Nash deviations towards cooperation in games, including the repeated prisoner's dilemma, the traveler's dilemma, the centipede game, and the repeated public goods game. Moreover, the optimin criterion generalizes and unifies results in various fields: It not only coincides with (i) Wald's statistical decision-making criterion when Nature is antagonistic, (ii) the core in cooperative games when the core is nonempty, though it exists even if the core is empty, but also generalizes (iii) Nash equilibrium in n-person constant-sum games, (iv) stable matchings in matching models, and (v) competitive equilibrium in the Arrow-Debreu economy. Moreover, every Nash equilibrium that is not a strong maximin equilibrium there exists a strong maximin equilibrium that Pareto dominates it.
Edit intent: meaning-changed
Original:  Accordingly, we show that for every Nash equilibrium that is not a strong maximin equilibrium there exists a strong maximin equilibrium that Pareto dominates it. In addition, no strong maximin equilibrium is ever Pareto dominated by a Nash equilibrium. Finally, we discuss maximin equilibrium predictions in several games including the traveler's dilemma .
Revised:  Accordingly, we show that for every Nash equilibrium satisfies the optimin criterion in an auxiliary game .
Edit intent: meaning-changed
Original: Cooperation among individuals has been one of the most puzzling phonemena in economics and other social sciences. In this paper, I introduce a novel solution concept, dubbed the optimin criterion, which (to the best of my knowledge) is the first parameter-free concept that can selectively explain the direction of well-established non-Nash deviations towards cooperation in games, including the repeated prisoner's dilemma, the traveler's dilemma, the centipede game, and the repeated public goods game.
Revised: Applications of the maximin criterion extend beyond economics to statistics, computer science, politics, and operations research. However, the maximin criterion---be it von Neumann's, Wald's, or Rawls'---draws fierce criticism due to its extremely pessimistic stance. I propose a novel concept, dubbed the optimin criterion, which (to the best of my knowledge) is the first parameter-free concept that can selectively explain the direction of well-established non-Nash deviations towards cooperation in games, including the repeated prisoner's dilemma, the traveler's dilemma, the centipede game, and the repeated public goods game.
Edit intent: meaning-changed
Original:  In this paper, I introduce a novel solution concept, dubbed the optimin criterion, which (to the best of my knowledge) is the first parameter-free concept that can selectively explain the direction of well-established non-Nash deviations towards cooperation in games, including the repeated prisoner's dilemma, the traveler's dilemma, the centipede game, and the repeated public goods game. Moreover, the optimin criterion generalizes and unifies results in various fields: It not only coincides with (i) Wald's statistical decision-making criterion when Nature is antagonistic, (ii) the core in cooperative games when the core is nonempty, though it exists even if the core is empty, but  also generalizes (iii) Nash equilibrium in n-person constant-sum games, (iv) stable matchings in matching models, and (v) competitive equilibrium in the Arrow-Debreu economy.
Revised:  In this paper, I introduce a novel solution concept, dubbed the optimin criterion, which is based on (Pareto) optimizing the worst-case payoffs of tacit agreements. The optimin criterion generalizes and unifies results in various fields: It not only coincides with (i) Wald's statistical decision-making criterion when Nature is antagonistic, (ii) the core in cooperative games when the core is nonempty, though it exists even if the core is empty, but also generalizes (iii) Nash equilibrium in n-person constant-sum games, (iv) stable matchings in matching models, and (v) competitive equilibrium in the Arrow-Debreu economy.
Edit intent: meaning-changed
Original:  Moreover, the optimin criterion generalizes and unifies results in various fields: It not only coincides with (i) Wald's statistical decision-making criterion when Nature is antagonistic, (ii) the core in cooperative games when the core is nonempty, though it exists even if the core is empty, but  also generalizes (iii) Nash equilibrium in n-person constant-sum games, (iv) stable matchings in matching models, and (v) competitive equilibrium in the Arrow-Debreu economy.
Revised:  Moreover, the optimin criterion generalizes and unifies results in various fields: It not only coincides with (i) Wald's statistical decision-making criterion when Nature is antagonistic, (ii) the core in cooperative games when the core is nonempty, though it exists even if the core is empty, but it also generalizes (iii) Nash equilibrium in n-person constant-sum games, (iv) stable matchings in matching models, and (v) competitive equilibrium in the Arrow-Debreu economy.
Edit intent: fluency
Original:  We introduce stable techniquesbased on well-established dimensionality-reduction techniques : Principle Component Analysis, Sammon mapping, and t-SNE. Our Stable Principal Component method is explicitly parametrized for stability, allowing a trade-off between the two quality criteria .
Revised:  Previous work has considered only the creation of 1D orderings, using spatial subdivisions and clustering techniques. In contrast, we propose to use actual dimensionality-reduction techniques : Principle Component Analysis, Sammon mapping, and t-SNE. Our Stable Principal Component method is explicitly parametrized for stability, allowing a trade-off between the two quality criteria .
Edit intent: meaning-changed
Original:  We introduce stable techniquesbased on well-established dimensionality-reduction techniques : Principle Component Analysis, Sammon mapping, and t-SNE. Our Stable Principal Component method is explicitly parametrized for stability, allowing a trade-off between the two quality criteria .
Revised:  We introduce stable techniquesbased on well-established dimensionality-reduction techniques to compute stable and spatially informative 1D representations. These more general 1D representations provide the user with additional visual cues describing the spatial distribution of the data, and naturally imply also a 1D ordering. To make dimensionality-reduction techniques suitable for visual summaries, we introduce stable variants of Principle Component Analysis, Sammon mapping, and t-SNE. Our Stable Principal Component method is explicitly parametrized for stability, allowing a trade-off between the two quality criteria .
Edit intent: meaning-changed
Original:  We introduce stable techniquesbased on well-established dimensionality-reduction techniques : Principle Component Analysis, Sammon mapping, and t-SNE. Our Stable Principal Component method is explicitly parametrized for stability, allowing a trade-off between the two quality criteria .
Revised:  We introduce stable techniquesbased on well-established dimensionality-reduction techniques : Principle Component Analysis, Sammon mapping, and t-SNE. Our Stable Principal Component method is explicitly parametrized for stability, allowing a trade-off between the spatial quality and stability .
Edit intent: meaning-changed
Original:  We conduct computational experiments that compare our stable methods to various state-of-the-art approaches using a set of well-established quality metrics that capture the two main criteria.
Revised:  We conduct computational experiments that quantitatively compare the 1D orderings produced by our stable dimensionality-reduction methods to various state-of-the-art approaches using a set of well-established quality metrics that capture the two main criteria.
Edit intent: meaning-changed
Original:  We conduct computational experiments that compare our stable methods to various state-of-the-art approaches using a set of well-established quality metrics that capture the two main criteria. These experiments demonstrate that our stable algorithms outperform existing methods on stability, without sacrificing spatial quality or efficiency.
Revised:  We conduct computational experiments that compare our stable methods to various state-of-the-art approaches using a set of well-established quality metrics that capture spatial quality and stability. We conclude that our stable algorithms outperform existing methods on stability, without sacrificing spatial quality or efficiency.
Edit intent: clarity
Original:  As a starting point, open convex codes have a desirable monotonicity property,  but here we show that  closed convex codes do not possess the same property.
Revised:  As a starting point, open convex codes have a desirable monotonicity property, namely, adding non-maximal codewords preserves open convexity; but here we show that closed convex codes do not possess the same property.
Edit intent: meaning-changed
Original:  As a starting point, open convex codes have a desirable monotonicity property,  but here we show that  closed convex codes do not possess the same property. We additionally show that, even for 3-sparse codes, closed convexity is not equivalent to avoiding local obstructions to convexity .
Revised:  As a starting point, open convex codes have a desirable monotonicity property, but here we show that closed convex codes .
Edit intent: clarity
Original:   Finally, we disprove a conjecture of Goldrup and Phillipson, and then present an example of a code that is neither open convex nor closed convex.
Revised:  Additionally, while adding non-maximal codewords can only increase the open embedding dimension by 1, here we demonstrate that adding a single such codeword can increase the closed embedding dimension by an arbitrarily large amount. Finally, we disprove a conjecture of Goldrup and Phillipson, and then present an example of a code that is neither open convex nor closed convex.
Edit intent: meaning-changed
Original:  Currently, most TL approaches require the source domains to have the same feature space and label space as the target domain, which limits their applications, as the auxiliary data may have different feature spaces and/or different label spaces.
Revised:  Currently, most domain adaptation approaches require the source domains to have the same feature space and label space as the target domain, which limits their applications, as the auxiliary data may have different feature spaces and/or different label spaces.
Edit intent: clarity
Original:  capitulation during the so-called Cambridge controversy on the re-switching of techniques in capital theory had implications not only in pointing at supposed internal contradiction of the marginal theory of production and distribution, but also in the pursue of vested interests of vested interests in the academic and political world to this day . Based on a new non-switching theorem (Milana, 2019)
Revised:  capitulation during the so-called Cambridge controversy on the re-switching of techniques in capital theory had implications not only in pointing at supposed internal contradiction of the marginal theory of production and distribution, but also in preserving vested interests in the academic and political world to this day . Based on a new non-switching theorem (Milana, 2019)
Edit intent: clarity