caprion/mscinli_2_class huggingface dataset:
Domain: NeurIPS
Premise: This seems to suggest a degree of anti-stereotypical associations, but none of the tests which have negative effect sizes are significant Table 5: Intersectional embedding association tests and effect sizes, for word encodings (word), sentence encoding (sent) and contextual word representation (c-word).
Hypothesis: there are only 2 significant positive associations for test +I4, but there are 9 such associations for test +I3 across all models.
Relation: neutral
Domain: Software and its engineering
Premise: We used insights obtained from our first analysis to se­lect the next incidents for analysis.
Hypothesis: after the first incident analysis we became cognisant of the different modalities in which data assets are prevalent in organisa­tions, namely (see Fig.  6(a)): data at rest (i.e., ‘inactive’ data stored in databases, file servers, archives, etc. that is not accessed or changed frequently), data in use (i.e., ‘active’ data processed by applications and held in computer memory, CPU caches/registers, or operational tables in databases) and data in motion (i.e., data in transit in the form of packets transported by communication protocols and data traversing the network, temporarily residing in memory buffers to be forwarded).
Relation: entailment
Domain: Security and privacy
Premise: If such sensitive information is leaked out of the browser without protection, it can be used by unauthorized parties to illegally access users' online accounts, steal their online identities, or track their online behaviors.
Hypothesis: because the execution traces only contain the call relations and do not contain any information from users, they can also be shared (e.g., in a repository along with the extensions)among the analysts to further cover more execution paths of the extension.
Relation: neutral
Domain: Hardware
Premise: Meanwhile, the LEA will encrypt all candidate jmp destinations and triggers jmp decryption while executing jmp instructions, but some instructions at candidate destination addresses of jmp may also be executed sequentially (e.g. do-while or if-statement alone) without being the des­tination of the jmp.
Hypothesis: recent research aim at balancing the tradeoff between security and such overheads [8-12] by revising the software or modifying processor’s instruction set architecture (ISA).
Relation: neutral
Domain: NeurIPS
Premise: We borrow an idea from [BFKV96] that in some sense allows us to "reduce" the general case to the large margin case.
Hypothesis: [BFKV96] (see also [DV04a]) developed a pre-processing routine that slightly modifies the distribution on the unlabeled points and guarantees the following weak margin property: After preprocessing, there exists an explicit margin parameter Ïƒ = â„¦(1/poly(d, b)), such that any hyperplane through the origin has at least a non-trivial mass of the distribution at distance at least Ïƒ from it.
Relation: entailment
Domain: Software and its engineering
Premise: The overall goal of the workshop was to create a shared understanding of UX, provoke discussion and encourage rethinking and reflection, engage the employees to the design cultural change, co-create guidelines for empowerment, and ideate possible ways to implement them into the design process.
Hypothesis: a participatory workshop was conducted in order to prepare the employees to accept this still quite unfamiliar and sometimes confusing methodology of UX that was only slightly familiar to them.
Relation: entailment
Domain: Security and privacy
Premise: Larger keys, however, will not solve all the problems because as more devices can handle sufficiently large keys, and more employees migrate their work to mobile devices such as smart phones, the total number of keys that an organization has to manage may continue to increase.
Hypothesis: even though more devices will be able to use longer key lengths, the total number of keys may also become unmanageable for businesses as each employee's device is given its own unique key.
Relation: entailment
Domain: Software and its engineering
Premise: In this experiment, we plan to implement an BCI (Brain Computer Interaction) interface, where the user will be able to change the from an avatar to another by measuring his/her brain activity.
Hypothesis: if the User relaxes, her/his brain activity is in low level and its avatar morphs to a more gentle or friendly avatar, if the User is in alert, his/her brain activity is in high level and its avatar morphs to a more intimidating or hostile avatar.
Relation: entailment
Domain: NeurIPS
Premise: Most optimization methods for solving problems with the Schatten-p norm perform SVD on X at every iteration, with time complexity of O(m 2 n) (supposing m ≤ n) [21,22].
Hypothesis: the natural algorithm to minimize FGSR 2/3 and FGSR 1/2 does not use the SVD, as the regularizers are simple (not spectral) functions of the factors.
Relation: contrasting
Domain: Security and privacy
Premise: Federated identity services have gained widespread popularity among users as a simplifying means for managing their online identities.
Hypothesis: federated identity providers (e.g., Facebook and PayPal) employ authentication protocols such as OAuth [20, 21] and OpenID [34] to offer their users the convenience of using single identity and thus a single credential  to log into and access various third-party applications (e.g., Wiki and StackOverflow).
Relation: entailment
Domain: NeurIPS
Premise: In fact, even finding local Nash equilibria is NP-hard in the general non-convex non-concave regime.In addition, as shown by [28, Proposition 10], local Nash equilibria for general non-convex non-concave games may not exist.
Hypothesis: consider the game min Then (0, 0) is the only first-order Nash equilibrium and is not a second-order Nash equilibrium.
Relation: neutral
Domain: Hardware
Premise: Although cloud environments are capable of providing virtualized, elastic, controllable and high quality on-demand services, they still lack the ability to control the selection and configuration of infrastructural components in response to changing requirements and environmental pressures.
Hypothesis: current Cloud environments still do not have the tools and application programming interfaces that would allow the developers to exert such control on the underlying infrastructure in an intelligent, semi-autonomous manner.
Relation: entailment
Domain: Hardware
Premise: Due to the workonly/allocation policy with vCache (geo-mean of three conserving policy of vCache, VM1 can exploit unallocated/unused capacity along with its allocated vLLC and thus vLLC shows higher performance than pLLC while preserving VM2 s performance.
Hypothesis: vM1 can exploit more capacity before VM2 fills its al located capacity, since VM2 does not fully utilize its allocated capacity.
Relation: entailment
Domain: NeurIPS
Premise: To make this more concrete, for illustration, consider the high-dimensional linear model that sufficiently wide networks have been shown to converge to [17].
Hypothesis: roughly, these networks can be written as h(x) = w T Ï†(x) where Ï†(x) is a rich high-dimensional representation of x computed from many random features (chosen independent of training data).
Relation: entailment
Domain: Networks
Premise: We set the benchmark parameters such that the dominant factor in server performance is the latency introduced by the networking stack at the endpoints and packet processing at VNToR, not by other server or switch bottlenecks.
Hypothesis: we ensure that: the working set of the rules fits in the hardware table; the ASIC-SupE interconnect inside the switch is not saturated;  the servers are neither CPU-nor I/O-bottleneck-ed.
Relation: entailment
Domain: Software and its engineering
Premise: Loop i is a parallel loop and therefore we can redistribute the stores among the threads to ensure coalesced access.
Hypothesis: we can use the i loop in the thread code as an additional source of parallel threads, and compute a new 2D geometry in place of the original 1D one, such that accesses will be coalesced for tx: in this example this amounts to (1) making i the tx dimension, updating bx correspondingly to capture N threads; and (2) make the original tx dimension ty in the transformed code.
Relation: entailment
Domain: Hardware
Premise: Assuming 20% of our post-layout top critical path will be RC-delay and 80% cell-delay, the di.erence between pre-layout and post-layout speedup for 25.C to 125.C, will be 7% lower in 20nm at nominal voltage.
Hypothesis: post-layout speedup as a result of increase in temperature is lower than that of pre-layout.
Relation: entailment
Domain: Security and privacy
Premise: 2.2 Efects of MV Based Steganography on Video Statistics According to current MV based steganography [1, 3, 6, 10, 27, 29], one or two components of a MV can be modified during e emmbeding.
Hypothesis: the features in [20] and [26] are based on the first-order distributions (histograms) of NMVDs and the joint distributions of NMVDs.
Relation: neutral
Domain: Networks
Premise: In terms of sheer volume, during April 2015, Gmail was able to validate 94% of inbound messages using a combination of DKIM (83%) and SPF (92%).
Hypothesis: among the Alexa Top Million mail servers, only 47% deploy SPF policies and only 1% provide a DMARC policy, the absence of which leaves recipients unsure whether an unsigned message is invalid or expected.
Relation: contrasting
Domain: NeurIPS
Premise: In all our experiments, we assume that the weightfunction comes from the class F of mixture of m 2D non-negatively weighted Gaussians as described in the end of Section 3.2.
Hypothesis: the persistent homology is one of the most important developments in the field of topological data analysis, and there have been fundamental developments both on the theoretical front (e.g, [23,10,13,8,14,5]), and on algorithms / implementations (e.g, [43,4,15,20,29,3]).
Relation: neutral
Domain: NeurIPS
Premise: Among the many applications of deep networks, sequence modeling has witnessed continuous advances in model architectures.
Hypothesis: while recurrent networks have long been the dominant model for sequences [21,26,14,34], deep feedforward architectures based on temporal convolutions [49,47,7] and self-attention [48,16,13] have (re-)emerged to claim superior performance on a variety of sequence prediction tasks.
Relation: entailment
Domain: Networks
Premise: One heuristic approach to reducing the number of mapping units for end-user mapping is to use the IP blocks (i.e., CIDRs) in BGP feeds that are the units for routing in the Internet.
Hypothesis: if a set of /24 IP blocks belong within the same BGP CIDR, these blocks can be combined since they are likely proximal in the network sense. 
Relation: entailment
Domain: NeurIPS
Premise: We can clearly see that increasing the size of the orientation set in OMP results in a larger angular distance since more dissimilar orientations are included.
Hypothesis: the angular distance of candidate sets chosen by GreedyOrientation decreases fast and then stabilized, which indicates that GreedyOrientation forward selection criterion is defined well so that the best candidate orientations approximate the ground truth are among the immediate ones.
Relation: contrasting
Domain: Security and privacy
Premise: However, this is not feasible in current canary-based pro­tectors, as hardened programs do not store any information regarding where (in their address space) their canaries are stored.
Hypothesis: once a child process is forked, there is no way for it to access the canaries in the frames it inherited from its parent process, as it cannot differentiate canaries from random data that may be residing in the stack.
Relation: reasoning
Domain: NeurIPS
Premise: Louizos et al. [2017] studied scale mixtures of Gaussian priors and half-Cauchy scale priors for the hidden units of VGG models [Simonyan and Zisserman, 2014] and achieved good model compression performance on CIFAR10 [Krizhevsky, 2009] using VI.
Hypothesis: due to the limitation of VI in non-convex optimization, the compression is still not sparse enough and can be further optimized.
Relation: contrasting
Domain: NeurIPS
Premise: To address the problem, [50,52] try to learn a combination of different criteria, i.e., weights of a mixture of submodular functions.
Hypothesis: chengguang Xu would like to thank Dat Huynh and Zwe Naing for their help and advice with some of the implementations during his research assistantship at MCADS lab, which resulted in this work.
Relation: neutral
Domain: NeurIPS
Premise: Even Density Functional Theory (DFT) [Hohenberg and Kohn, 1964], a widely used approximation to the equations of quantum mechanics, has trouble scaling to more than a few hundred atoms.
Hypothesis: the majority of practical work in molecular dynamics today falls back on fundamentally classical models, where the atoms are essentially treated as solid balls and the forces between them are given by pre-defined formulae called atomic force fields or empirical potentials, such as the CHARMM family of models [Brooks et al., 1983[Brooks et al., , 2009.
Relation: reasoning
Domain: Software and its engineering
Premise: By looking at the results reported by the accuracy measure and F1­measure, we can see a discrepancy between them, possibly due to the sample size and, more importantly, our use of 10-way cross validation, which usually overestimates errors in models [20].
Hypothesis: the real performance of the models in F1-measure exceeds the values reported in Table 6.
Relation: entailment
Domain: Hardware
Premise: CHStone suite is a set of 12 benchmarks, explicitly collected for the evaluation of High Level Synthesis flows, which aim at representing all the possible scenarios which have to be addressed by an High Level Synthesis tool.
Hypothesis: this suite contains both data dominated applications (aes, blow.sh, jpeg, mpeg2, sha) and control oriented applications (adpcm, dfadd, dfdiv, dfmul, dfsin, gsm, mips).
Relation: entailment
Domain: NeurIPS
Premise: Our approach generalizes many existing algorithms (see Table 2), and makes possible new algorithms with more flexibility and tighter handling of non-linear rate constraints.
Hypothesis: we give a new method (Algorithm 2) that can handle a wider range of performance metrics than previous surrogate methods (such as e.g. KL-divergence based metrics that only take inputs from a restricted range), and can be applied to constrained training problems without the risk of over-constraining the model because it needs to use surrogates less. 
Relation: entailment
Domain: NeurIPS
Premise: We further use this framework to derive the first asynchronous online and stochastic optimization algorithm with non-box constraints that uses non-Euclidean regularizers.
Hypothesis: we present and analyze HEDGEHOG, the parallel asynchronous variant of the EG algorithm, also known as Hedge in online linear optimization [34,14], 2 In this paper, we do not further consider BCD-based methods, for two main reasons: a) in general, a BCD update may unnecessarily slow down the convergence of the algorithm by focusing only on a single coordinate of the gradient information, especially in the sparse-data problems we consider in this paper (see, e.g., Pedregosa et al.
Relation: entailment
Domain: NeurIPS
Premise: Of particular interest are asynchronous lock-free algorithms, where Recht et al. [30] demostrated first that linear speed-ups are possible: They showed that if ⌧ processes run stochastic gradient descent (SGD) and apply their updates to the same shared iterate without locking, then the overall algorithm (called Hogwild!) converges after the same amount of work as serial SGD, up to a multiplicative factor that increases with the number of concurrent processes and decreases with the sparsity of the problem.
Hypothesis: if the problem is sparse enough, this penalty can be considered a constant, and the algorithm achieves linear speed-up.
Relation: reasoning
Domain: Hardware
Premise: The difference is largest in 64-core execution of radiosity, where lock synchronization is frequent, but with many low-contention locks.
Hypothesis: this may be an important consideration for processor manufacturers -after adding the synchronization instructions and our MSA/OMU hardware, the processor man­ufacturer can drop MSA/OMU support in future generations of the processor without breaking compatibility with software that uses the new instructions.
Relation: neutral
Domain: Networks
Premise: The virtualization of IP telecommunications networks provides an opportunity for deeper knowledge about security to be embedded inside such networks through a combination of real-time analysis of network behavior and the leveraging of the dynamic reconfiguration capabilities of virtualized networks.
Hypothesis: this combination of analytics and autonomics offers the potential for networks to automatically detect security threats in real-time, dynamically reconfigure themselves to protect against these threats, and automatically immunize themselves against evolving threat, reducing the response time from days to minutes.
Relation: entailment
Domain: NeurIPS
Premise: Motivated by the seemingly insurmountable hurdles towards developing bounds satisfying all the above five necessary criteria, we take a step back and examine how the underlying technique of uniform convergence may itself be inherently limited in the overparameterized regime.
Hypothesis: we present examples of overparameterized linear classifiers and neural networks trained by GD (or SGD) where uniform convergence can provably fail to explain generalization.
Relation: entailment
Domain: NeurIPS
Premise: Motivated by real-world applications, we assume that functions are smooth, their associated distributions have a bounded second moment, and their minimizer drifts in a bounded manner, but do not assume they are strongly convex.
Hypothesis: our assumptions hold for online Bayesian logistic regression, when the data satisfy natural regularity properties, giving a sampling algorithm with updates that are poly-logarithmic in T .
Relation: entailment
Domain: Security and privacy
Premise: These benchmarks include Web Standards Project's Acid3 [1, 32] and the Dromaeo Test Suite developed by Mozilla [10].
Hypothesis: this is not an option for us, because it would violate our main goal of not altering any code outside of Blink (to completely inherit its portability) and of introducing only low overhead so that WebCapsule can be used as an "always on" forensic data collection system.
Relation: neutral
Domain: NeurIPS
Premise: The design of our generative model is inspired by the way humans write articles: Each word should be semantically consistent with not only its surrounding words, but also the entire paragraph/document.
Hypothesis: we assume text generation is a two-step process: A center word is first generated according to the semantics of the paragraph, and then the surrounding words are generated based on the center word's semantics 2 .
Relation: entailment
Domain: Networks
Premise: Through our study, we observe that for any three consecutive WiFi bands, if the CSI phases in the first and the third channels are well compensated, they can serve as two anchors to further cali­brate the CSI phase from the second band if its phase error is not fully corrected.
Hypothesis: we can rotate the CSI phase from the second band and stop when its phase differences for the overlapped sub-carriers with other two bands are minimized.
Relation: entailment
Domain: Networks
Premise: Pro­posals such as nutrition labels [24] could also help empower consumers by making them more aware of the QoS to expect and then use the information to make better choices when buying data plans.
Hypothesis: unless TRAI does not mandate some minimum QoS standards to which providers can be held accountable, or the published information is not made available to consumers easily to be able to exercise their choice in selecting providers, even these stronger regu­latory measures may arguably not yield much benefits.
Relation: contrasting
Domain: Security and privacy
Premise: Expectedly, the success rate should increase and we evaluate this hypothesis through a modified version of the prior experiment.
Hypothesis: we constructed a dictionary using 4 news reports [4, 15, 9, 7] from BBC News, all were writ­ ten by Smitha Mundasad, a health reporter specialized in medical 7We replace the word obfuscating with obfuscation , since we could not .nd the word obfuscating in the dictionary.
Relation: entailment
Domain: Hardware
Premise: This is important since ourtarget is to increase the reliability of the latency-sensitive L1s.In order to calculate access time, we modified CACTI source code to integrate the DARCA extra components into the design.
Hypothesis: the extra components are i) the variabletag selection logic (below tag arrays), ii) the index bit selectionlogic (before cache decoder), and iii) the extra level ofmultiplexer (below data arrays).
Relation: entailment
Domain: Hardware
Premise: While CSE preserves the cluster structure through the conversion from a proximity representation to a Euclidean vector representation (e.g., the cluster structure is preserved between E1 and P1 , between E2 and P2, and so on), the k-means cost function in the original feature space O1 would also be identical to the cost function of pairwise clustering in the proximity matrix derived using Euclidean distance P1 [19].
Hypothesis: applying k-means clustering in E1 is equivalent to applying k-means clustering in O1.
Relation: reasoning
Domain: Security and privacy
Premise: In 2004, Gura et al [7] published a now-classical paper in which they demonstrated that, in contrast to conventional wisdom, strong PKC is feasible for small battery-powered sensor nodes.
Hypothesis: they showed that Elliptic Curve Cryptography (ECC) [8], when carefully implemented and optimized, is computationally less costly than was believed at that time.
Relation: entailment
Domain: Security and privacy
Premise: OSN Connection Spillover: ability to later establish actual OSN connections, based on prior off-line interaction that resulted in mutual agreement to connect.
Hypothesis: it should be possible for two peers to connect via the OSN at some point when they are online, if they have decided to do so as a result of sufficient degree of commonality among their profiles, e.g., at least k shared friends.
Relation: entailment
Domain: Software and its engineering
Premise: Each miner receiving a newly cre­ated block validates the block's integrity.
Hypothesis: it makes sure that (i) the block's SHA-2562 is indeed lower than the difficulty threshold, (ii) all transactions in it are legitimate (i.e., if all input coins are in the UTxO set and are signed by their claimed owners), and that (iii) the miner that created it has allocated the correct amount to his own wallet (i.e., the number of bitcoins offered per created block, plus the fees of all included transactions).
Relation: entailment
Domain: Security and privacy
Premise: Issues with side channels: Under the assumptions that stackbase address randomization is not employed and that the key is not changed when restarting a program and Sovarel et al. [38] use timing side-channels to determine the key value on Intel x86 architectures.
Hypothesis: one key factor in their attack was the assumption that the remote machine is running a certain version of an Apache server, whose behavior is used as a side-channel.
Relation: neutral
Domain: NeurIPS
Premise: In this section we present: (i) some qualitative insights of our meta-model by showing how it is able to coherently represent a sets of tasks in its latent space, (ii) an illustration of why PROFET helps to obtain statistically meaningful results and (iii) a comparison of various methods from the literature on our new benchmark suite.
Hypothesis: we show results for the following state-of-the-art BO methods as well as two popular evolutionary algorithms: â€¢ BO with Gaussian processes (BO-GP) [22].
Relation: entailment