wanyu/IteraTeR_v2 huggingface dataset:
Original:  or (b) return or the number of valuations of the nulls of D yielding a completion that satisfies q. We obtain dichotomies between \#P-hardness and polynomial-time computability for these problems when q is a self-join--free conjunctive query, and study the impact on the complexity of the following two restrictions: (1) every null occurs at most once in D (what is called Codd tables);
Revised:  or (b) return the number of valuations of the nulls of D yielding a completion that satisfies q. We obtain dichotomies between \#P-hardness and polynomial-time computability for these problems when q is a self-join--free conjunctive query, and study the impact on the complexity of the following two restrictions: (1) every null occurs at most once in D (what is called Codd tables);
Edit intent: fluency
Original:  or (b) return or the number of valuations of the nulls of D yielding a completion that satisfies q. We obtain dichotomies between \#P-hardness and polynomial-time computability for these problems when q is a self-join--free conjunctive query, and study the impact on the complexity of the following two restrictions: (1) every null occurs at most once in D (what is called Codd tables);
Revised:  or (b) return or the number of valuations of the nulls of D yielding a completion that satisfies q. We obtain dichotomies between \#P-hardness and polynomial-time computability for these problems when q is a self-join-free conjunctive query, and study the impact on the complexity of the following two restrictions: (1) every null occurs at most once in D (what is called Codd tables);
Edit intent: fluency
Original:  We first extend a nonlinear-acceleration (NA) framework (Jiang and Tchelepi 2019) to multi-component compositional models, for ensuring robust outer-loop convergence.
Revised:  We first extended a nonlinear-acceleration (NA) framework (Jiang and Tchelepi 2019) to multi-component compositional models, for ensuring robust outer-loop convergence.
Edit intent: fluency
Original:  We then develop inexact-type methods that alleviate `over-solving'.
Revised:  We then developed inexact-type methods that alleviate `over-solving'.
Edit intent: fluency
Original:  The new SFI solver is tested using several complex cases.
Revised:  The new SFI solver was tested using several complex cases.
Edit intent: clarity
Original:  We compare different strategies such as fixed relaxations on absolute and relative tolerances for the inner solvers, as well as an adaptive approach.
Revised:  We compared different strategies such as fixed relaxations on absolute and relative tolerances for the inner solvers, as well as an adaptive approach.
Edit intent: fluency
Original:  We also prove that a graph has a (+1,-1)-vector in the nullspace of its Seidel matrix if and only if its order is 4k + 1 and it belongs to the switching class of a 2k-regular graph for some natural number k .
Revised:  We also derive some characteristics of vectors in the nullspace of its Seidel matrix if and only if its order is 4k + 1 and it belongs to the switching class of a 2k-regular graph for some natural number k .
Edit intent: clarity
Original:  In this paper, we study such a version of the classic single selection optimal stopping problem , as introduced by Kaplan et al. 2020%DIFDELCMD < ]%%% . In this problem a collection of arbitrary non-negative numbers is shuffled in uniform random order.
Revised:  In this paper, we study such a version of the classic single selection optimal stopping problem , as introduced by Kaplan et al. %DIFDELCMD < ]%%% . In this problem a collection of arbitrary non-negative numbers is shuffled in uniform random order.
Edit intent: fluency
Original:  We develop an approach, based on the continuous limit of a factor revealing LP, that allows us to obtain the best possible rank-based (ordinal) algorithm for any value\le \le of p. Notably, we prove that as p approaches 1, our guarantee approaches 0.745, matching the best possible guarantee for the i.i.d.  prophet inequality.
Revised:  We develop an approach, based on the continuous limit of a factor revealing LP, that allows us to obtain the best possible rank-based (ordinal) algorithm for any value\le \le of p. Notably, we prove that as p approaches 1, our guarantee approaches 0.745, matching that of the i.i.d. prophet inequality.
Edit intent: clarity
Original:  We develop an approach, based on the continuous limit of a factor revealing LP, that allows us to obtain the best possible rank-based (ordinal) algorithm for any value\le \le of p. Notably, we prove that as p approaches 1, our guarantee approaches 0.745, matching the best possible guarantee for the i.i.d.  prophet inequality.
Revised:  We develop an approach, based on the continuous limit of a factor revealing LP, that allows us to obtain the best possible rank-based (ordinal) algorithm for any value\le \le of p. Notably, we prove that as p approaches 1, our guarantee approaches 0.745, matching the best possible guarantee for the i.i.d. ~ prophet inequality.
Edit intent: fluency
Original:  This paper provides a general model of how personalized policy creates incentives for individuals to modify their behavior to obtain a better treatment.
Revised:  Personalized policy introduces incentives for individuals to modify their behavior to obtain a better treatment.
Edit intent: clarity
Original:  For a given planner objective, we show that standard estimators based on repeated risk minimization produce a suboptimal policy .
Revised:  We show standard risk minimization-based estimators are sub-optimal when observed covariates are endogenous to the treatment allocation rule .
Edit intent: clarity
Original:  We propose a dynamic experiment that estimates the optimal treatment allocation function when agents are strategic and has regret that decays at a linear rate.
Revised:  We propose a dynamic experiment that converges to the optimal treatment allocation function when agents are strategic and has regret that decays at a linear rate.
Edit intent: clarity
Original:  Personalized policy introduces incentives for individuals to modify their behavior to obtain a better treatment.
Revised:  Policy targeting introduces incentives for individuals to modify their behavior to obtain a better treatment.
Edit intent: clarity
Original:  To obtain this result we provide  fine-grained characterization of the convergence rates of extragradient methods for solving monotone variational inequalities in terms of a natural condition we call relative Lipschitzness.
Revised:  To obtain this result we provide a fine-grained characterization of the convergence rates of extragradient methods for solving monotone variational inequalities in terms of a natural condition we call relative Lipschitzness.
Edit intent: fluency
Original:  In this paper, we introduce a property of distributive lattices, which we term as affine representability, and show its role in efficiently solving linear optimization problems over the elements of a distributive lattice, as well as describing the convex hull of the characteristic vectors of  lattice elements.
Revised:  In this paper, we introduce a property of distributive lattices, which we term as affine representability, and show its role in efficiently solving linear optimization problems over the elements of a distributive lattice, as well as describing the convex hull of the characteristic vectors of the lattice elements.
Edit intent: fluency
Original:  The information contained in the three layers is combined by implementing a fused similarity network.
Revised:  The information contained in the three layers is then combined by building a fused similarity network.
Edit intent: clarity
Original:  As to information and library sciences and statistics, the clusters of journals reflect sub-field specializations.
Revised:  In information and library sciences and statistics, the clusters of journals reflect sub-field specializations.
Edit intent: fluency
Original:  As to economics, clusters of journals appear to be better interpreted in terms of alternative methodological approaches.
Revised:  In economics, clusters of journals appear to be better interpreted in terms of alternative methodological approaches.
Edit intent: clarity
Original:  Thus, the graphs representing the clusters of journals in the fused network are powerful explorative instruments for exploring research fields.
Revised:  Thus, the graphs representing the clusters of journals in the fused network are powerful instruments for exploring research fields.
Edit intent: clarity
Original: Recent work has shown promising results using Hebbian meta-learning  to solve hard reinforcement learning problems and adapt-to a limited degree-to changes in the environment.
Revised:  Hebbian meta-learning to solve hard reinforcement learning problems and adapt-to a limited degree-to changes in the environment.
Edit intent: clarity
Original: Recent work has shown promising results using Hebbian meta-learning  to solve hard reinforcement learning problems and adapt-to a limited degree-to changes in the environment.
Revised: Recent work has shown promising results using Hebbian meta-learning to solve hard reinforcement learning problems , allowing agents to adapt to some degree to changes in the environment.
Edit intent: clarity
Original:  This allows each synapse to learn very specific learning rules and we hypothesize this limits the ability to discover generally useful Hebbian learning rules .
Revised:  This allows each synapse to learn very specific learning rule, the ability to discover generally useful Hebbian learning rules .
Edit intent: clarity
Original:  We find that scientific expert communities received a disproportionate amount of attention early on during the pandemic, and were leading the discussion at the time.
Revised:  The science- and health-related super-community received disproportionate attention early on during the pandemic, and were leading the discussion at the time.
Edit intent: clarity
Original:  We find that scientific expert communities received a disproportionate amount of attention early on during the pandemic, and were leading the discussion at the time.
Revised:  We find that scientific expert communities received a disproportionate amount of attention early on during the pandemic, and was leading the discussion at the time.
Edit intent: fluency
Original:  Scientific experts remained present in the discussion, but experienced less reach and a higher degree of segregation and isolation .
Revised:  Scientific experts remained present in the discussion, but experienced less reach and became more isolated within the network .
Edit intent: clarity
Original:  Overall, the emerging  communities are characterized by an increased self-amplification and polarization.
Revised:  Overall, the emerging network communities are characterized by an increased self-amplification and polarization.
Edit intent: clarity
Original:  These results may have implications for information dissemination in future global crises .
Revised:  These results may have implications for information dissemination along the unfolding of long-term events like epidemic diseases on a world-wide scale .
Edit intent: clarity
Original:  A CNN is interpreted as a graph, with the operator norm of each convolution as distance metric for the edges.
Revised:  A CNN is interpreted as a graph, with the operator norm of each operator as distance metric for the edges.
Edit intent: clarity
Original:  The main idea is to reduce the stiffness of the problem by subtracting to the standard stiffness bilinear form a least-squares penalty on the gradient jumps across the mesh interfaces  .
Revised:  The main idea is to reduce the stiffness of the problem by subtracting a least-squares penalty on the gradient jumps across the mesh interfaces .
Edit intent: clarity
Original: This paper presents a focused analysis of human studies in explainable artificial intelligence (XAI) entailing qualitative investigation.
Revised: We present a focused analysis of human studies in explainable artificial intelligence (XAI) entailing qualitative investigation.
Edit intent: clarity
Original: This paper presents a focused analysis of human studies in explainable artificial intelligence (XAI) entailing qualitative investigation.
Revised: This paper presents a focused analysis of user studies in explainable artificial intelligence (XAI) entailing qualitative investigation.
Edit intent: clarity
Original:  The results of our analysis support calls from others in the XAI community advocating for collaboration with experts from social disciplines to bolster rigor and effectiveness in human studies.
Revised:  The results of our analysis support calls from others in the XAI community advocating for collaboration with experts from social disciplines to bolster rigor and effectiveness in user studies.
Edit intent: clarity
Original: Suppose an oracle knows a string S that is unknown to us and  we want to determine.
Revised: Suppose an oracle knows a string S that is unknown to us and that we want to determine.
Edit intent: coherence
Original:  We first show that any string of length n over an integer alphabet of size \sigma with %DIFDELCMD < {\sf %DIFDELCMD < %%% rle runs can be reconstructed with q=O( %DIFDELCMD < {\sf %%% rle (\sigma + \log \frac{n{{\sf rle}}}  )) substring queries in linear time and space.
Revised:  We first show that any string of length n over an integer alphabet of size \sigma with %DIFDELCMD < {\sf %DIFDELCMD < %%% rle runs can be reconstructed with q=O( %DIFDELCMD < {\sf %%% rle (\sigma + \log \frac{n{{\sf rle}}} )) substring queries in linear time and space.
Edit intent: fluency
Original:  We first show that any string of length n over an integer alphabet of size \sigma with %DIFDELCMD < {\sf %DIFDELCMD < %%% rle runs can be reconstructed with q=O( %DIFDELCMD < {\sf %%% rle (\sigma + \log \frac{n{{\sf rle}}}  )) substring queries in linear time and space.
Revised:  We first show that any string of length n over an integer alphabet of size \sigma with %DIFDELCMD < {\sf %DIFDELCMD < %%% rle runs can be reconstructed with q=O( %DIFDELCMD < {\sf %%% rle (\sigma + \log {{\sf rle}}} )) substring queries in linear time and space.
Edit intent: clarity
Original:  The oracle can answer queries of the form `` Is s a substring of S? ''.
Revised:  The oracle can answer queries of the form " Is s a substring of S? ''.
Edit intent: fluency
Original:  TheSubstring Query Complexity of a string S, denoted \chi(S), is the minimum number of adaptive substring queries that are needed to exactly reconstruct (or learn) S. It has been introduced in 1995 by Skiena and Sundaram , who showed that\chi(S) \geq \sigma n/4 -O(n) in the worst case , where \sigma is the size of the alphabet of S and n its length, and gave an algorithm that spends (\sigma-1)n+O(\sigma n) queries to reconstruct S.
Revised:  The of a string S, denoted \chi(S), is the minimum number of adaptive substring queries that are needed to exactly reconstruct (or learn) S. It has been introduced in 1995 by Skiena and Sundaram , who showed that\chi(S) \geq \sigma n/4 -O(n) in the worst case , where \sigma is the size of the alphabet of S and n its length, and gave an algorithm that spends (\sigma-1)n+O(\sigma n) queries to reconstruct S.
Edit intent: clarity
Original:  TheSubstring Query Complexity of a string S, denoted \chi(S), is the minimum number of adaptive substring queries that are needed to exactly reconstruct (or learn) S. It has been introduced in 1995 by Skiena and Sundaram , who showed that\chi(S) \geq \sigma n/4 -O(n) in the worst case , where \sigma is the size of the alphabet of S and n its length, and gave an algorithm that spends (\sigma-1)n+O(\sigma n) queries to reconstruct S.
Revised:  TheSubstring Query Complexity ". In 1995 by Skiena and Sundaram , who showed that\chi(S) \geq \sigma n/4 -O(n) in the worst case , where \sigma is the size of the alphabet of S and n its length, and gave an algorithm that spends (\sigma-1)n+O(\sigma n) queries to reconstruct S.
Edit intent: coherence
Original:  TheSubstring Query Complexity of a string S, denoted \chi(S), is the minimum number of adaptive substring queries that are needed to exactly reconstruct (or learn) S. It has been introduced in 1995 by Skiena and Sundaram , who showed that\chi(S) \geq \sigma n/4 -O(n) in the worst case , where \sigma is the size of the alphabet of S and n its length, and gave an algorithm that spends (\sigma-1)n+O(\sigma n) queries to reconstruct S.
Revised:  TheSubstring Query Complexity of a string S, denoted \chi(S), is the minimum number of adaptive substring queries that are needed to exactly reconstruct (or learn) S. It has been introduced in 1995 , Skiena and Sundaram , who showed that\chi(S) \geq \sigma n/4 -O(n) in the worst case , where \sigma is the size of the alphabet of S and n its length, and gave an algorithm that spends (\sigma-1)n+O(\sigma n) queries to reconstruct S.
Edit intent: fluency
Original:  TheSubstring Query Complexity of a string S, denoted \chi(S), is the minimum number of adaptive substring queries that are needed to exactly reconstruct (or learn) S. It has been introduced in 1995 by Skiena and Sundaram , who showed that\chi(S) \geq \sigma n/4 -O(n) in the worst case , where \sigma is the size of the alphabet of S and n its length, and gave an algorithm that spends (\sigma-1)n+O(\sigma n) queries to reconstruct S.
Revised:  TheSubstring Query Complexity of a string S, denoted \chi(S), is the minimum number of adaptive substring queries that are needed to exactly reconstruct (or learn) S. It has been introduced in 1995 by Skiena and Sundaram showed that, in the worst case, any algorithm needs to ask the oracle \sigma n/4 -O(n) in the worst case , where \sigma is the size of the alphabet of S and n its length, and gave an algorithm that spends (\sigma-1)n+O(\sigma n) queries to reconstruct S.
Edit intent: clarity
Original:  More precisely, we show that linking voter roll data---containing individual-level voter turnout for specific voting locations along with race and age---can facilitate the construction of rigorous bias and reliability tests.
Revised:  More precisely, we show that linking voter roll data -- containing individual-level voter turnout for specific voting locations along with race and age---can facilitate the construction of rigorous bias and reliability tests.
Edit intent: fluency
Original:  More precisely, we show that linking voter roll data---containing individual-level voter turnout for specific voting locations along with race and age---can facilitate the construction of rigorous bias and reliability tests.
Revised:  More precisely, we show that linking voter roll data---containing individual-level voter turnout for specific voting locations along with race and age -- can facilitate the construction of rigorous bias and reliability tests.
Edit intent: fluency
Original: Efficient gradient computation of the Jacobian determinant term is a core problem of the normalizing flow framework.
Revised: Efficient gradient computation of the Jacobian determinant term is a core problem in many machine learning settings, and especially so in the normalizing flow framework.
Edit intent: clarity
Original:  Thus, most proposed flow models  either restrict to a function class with easy evaluation of the Jacobian determinant, or an efficient estimator thereof.
Revised:  Most proposed flow models either restrict to a function class with easy evaluation of the Jacobian determinant, or an efficient estimator thereof.
Edit intent: coherence
Original:  Thus, most proposed flow models  either restrict to a function class with easy evaluation of the Jacobian determinant, or an efficient estimator thereof.
Revised:  Thus, most proposed flow models therefore either restrict to a function class with easy evaluation of the Jacobian determinant, or an efficient estimator thereof.
Edit intent: coherence
Original:  We show experimentally that such models are remarkably stable and optimize to similar data likelihood values as their exact gradient counterparts, while  surpassing the performance of their functionally constrained counterparts.
Revised:  We show experimentally that such models are remarkably stable and optimize to similar data likelihood values as their exact gradient counterparts, while surpassing the performance of functionally constrained counterparts.
Edit intent: fluency
Original: Contact tracing via mobile applications is gaining significant traction in the battle against Covid-19.
Edit intent: coherence
Original:  Our second contribution is the design  of SpreadMeNot, a novel contact tracing protocol that can defend against most passive and active attacks, thus providing strong (provable) security and privacy guarantees that are necessary for such a sensitive application.
Revised:  Our second contribution is the design and implementation of SpreadMeNot, a novel contact tracing protocol that can defend against most passive and active attacks, thus providing strong (provable) security and privacy guarantees that are necessary for such a sensitive application.
Edit intent: clarity
Original:  Moreover, we experimentally demonstrate that SpreadMeNot---while being built on asymmetric crypto primitives---sports little overhead.
Edit intent: coherence
Original:  Our detailed analysis, both formal and experimental, shows that SpreadMeNot satisfies security, privacy, and performance requirements, hence being an ideal candidate for building a contact tracing solution that can be adopted by the majority of the general public, as well as to serve as an open source reference for further developments in the field.
Revised:  Our detailed analysis, both formal and experimental, shows that SpreadMeNot satisfies security, privacy, and performance requirements, hence being an ideal candidate for building a contact tracing solution that can be adopted by the majority of the general public, as well as to serve as an open-source reference for further developments in the field.
Edit intent: fluency
Original:  Our model is trained with a task-performance/ communication-cost trade off .
Revised:  Our model is trained with a task-performance/ communication-cost trade-off .
Edit intent: fluency
Original:  While working within the trade off , our method can intelligently stream from more microphones in lower SNR scenes and fewer microphones in higher SNR scenes.
Revised:  While working within the trade-off , our method can intelligently stream from more microphones in lower SNR scenes and fewer microphones in higher SNR scenes.
Edit intent: fluency
Original:  We evaluate the model in a complex echoic acoustic scene with moving sources and show that it matches the performance of a baseline model while streaming less data .
Revised:  We evaluate the model in complex echoic acoustic scene with moving sources and show that it matches the performance of a baseline model while streaming less data .
Edit intent: fluency
Original:  We evaluate the model in a complex echoic acoustic scene with moving sources and show that it matches the performance of a baseline model while streaming less data .
Revised:  We evaluate the model in a complex echoic acoustic scenes with moving sources and show that it matches the performance of a baseline model while streaming less data .
Edit intent: fluency
Original: We study how to utilize (possibly machine-learned) predictions in a model for optimization under uncertainty that allows an algorithm to query unknown data.
Revised: We study how to utilize (possibly machine-learned) predictions in a model for computing under uncertainty in which an algorithm can query unknown data.
Edit intent: clarity