caprion/mscinli_2_class huggingface dataset:
Domain: NeurIPS
Premise: This straightforward application of the Laplace mechanism was mentioned at least by Dwork and Smith [2009] and has been widely applied since by several authors [e.g. Zhang et al., 2016, Foulds et al., 2016, Park et al., 2016, Honkela et al., 2018, Bernstein and Sheldon, 2018.
Hypothesis:  Foulds et al. [2016]  show that the sufficient statistics perturbation is more efficient than OPS for models where both are applicable.
Relation: entailment
Domain: Hardware
Premise: This is simply because of the power-line switching overhead which becomes more notable when the system has to be turned off and on frequently.
Hypothesis: efficient power-gating can be applied to a unit which has the following characteristics: first, it should have a low utilization in order to have a good potential of being turned off, and second, its idleness must not be fragmented so that the power-line switching overhead remains negligible [11].
Relation: reasoning
Domain: Software and its engineering
Premise: The results of the proof-of-concept empirical study, i.e., which of the afore-mentioned mappings have been identified in the explored games, are outlined in Table I.
Hypothesis: the class diagram created for this mapping consists of an abstract Game class whose member function gameloop plays the role of the template method and defines the structure of the al-gorithm that implements the game loop.
Relation: neutral
Domain: Security and privacy
Premise: To test the effectiveness of Njas, we first developed a simple application performing the sensitive operations that our current prototype is able to monitor and, if necessary, block.
Hypothesis: this application attempts to perform the following operations: initiate several network connec­tions, access sensitive files on the SD card (such as the user s photos), send text messages to premium numbers, and ac­cess the user s contact list.
Relation: entailment
Domain: Networks
Premise: To increase the realism of emulators, hybrid approaches using traces to simulate the physical layer and emulation for the MAC layer have also been proposed [13, 24], however these have been limited to 802.11b networks and rely on measurements of Signal-to-Noise Ratio (SNR) to simulate the physical layer.
Hypothesis: the SNR can not be used to accurately predict frame fates [9].
Relation: contrasting
Domain: Security and privacy
Premise: In this section, we first introduce the SybilLimit proto­col [35], and then present our novel temporal attacks that allow an adversary to break SybilLimit s security guaran­tees.
Hypothesis: we show that an adversary can eventu­ally register an unbounded number of Sybil identities in the SybilLimit protocol (at a single instant in time).
Relation: entailment
Domain: NeurIPS
Premise: The saturating distance curves also show an effective range for λ values; for λ >> 0.2 (not shown), the computations eventually become more unstable, because more and more terms are assigned to the empirical distributions and the topics become too sparse complicating posterior inference.
Hypothesis: the entropies show how the topics become (on average) more sparse for increasing λ.
Relation: entailment
Domain: NeurIPS
Premise: In this section, we quantitatively evaluate the effectiveness of the proposed self-critical objective.
Hypothesis: we evaluate the fraction of false sensitivity where the predicted incorrect answer's sensitivity to the influential object (to which the correct answer is most sensitive) is greater than the Figure 4: Positive examples are showing that our self-critical reasoning approach prevents the incorrectly predicted answer in the UpDn baseline system from being sensitive to the most influential object.
Relation: entailment
Domain: NeurIPS
Premise: One desired property of such a probabilistic model is sharpness (or high accuracy), i.e., if possible, the model should assign the highest probability to the true tumour grade (which maybe can not be inferred from the image at hand but only by other means such as an additional immunohistochemical staining).
Hypothesis: to be able to trust the predictions the probabilities should be calibrated (or reliable) as well (DeGroot and Fienberg, 1983;Murphy and Winkler, 1977).
Relation: contrasting
Domain: NeurIPS
Premise: All the intermediate activations were then "re-computed" by solving the ODE layers backwards.
Hypothesis: it has been recently shown that such an approach could lead to incorrect gradients, due both to numerical instability and also to inconsistencies that relate to optimizing infinite dimensional operators (the so called Discretize-Then-Optimize vs. Optimize-Then-Discretize issue) [9].
Relation: contrasting
Domain: NeurIPS
Premise: Thus, the test error rate and the adversarial error estimate (calculated based on the same test set) must be close if the test set and the model are independent, and are expected to be different in the opposite case.
Hypothesis: if the gap between the two error estimates is large, the independence hypothesis (i.e., that the model and the test set are independent) is dubious and will be rejected.
Relation: entailment
Domain: Security and privacy
Premise: Davi et al. [18] conduct a systematic security analysis of the recently proposed CFI solutions including kBouncer [40], ROPecker [13], CFI for COTS binaries [58], ROPGuard [23], and Microsofts’ EMET tool [36].
Hypothesis: they derive a combined CFI policy that, for each type of indirect indirect branch and behavioral heuristic (e.g., the number of instruction executed between two indirect branches), uses the most restrictive setting among the aforementioned policies.
Relation: entailment
Domain: Security and privacy
Premise: The only modification needed is to commit on all the commitments of the input labels using a trapdoor commitment, so that in the simulation in case P1 is corrupted, the simulator could change the commitments on the input labels after it learns P1’s input. 
Hypothesis: (Note that once we model H as a random oracle, we can also use it as the statistically-hiding extractable commitment.)
Relation: neutral
Domain: Hardware
Premise: Another area that we would like to pursue is to explore ways to effectively insert the violation detector (XOR) logic which compares the value in the user register with the shadow register.
Hypothesis: this detection logic (and any downstream infrastructure) has the freedom to be placed anywhere on the device, as long as it does not extend Tcrit ; however, because this operation is a pairwise reduction (i.e.
Relation: entailment
Domain: Security and privacy
Premise: Nowadays, the XACML (eXtensible Access Control Markup Language) [1] has become the de facto standard in the context of access control systems.
Hypothesis: the second row reports the name of mutation operators, the first column the Sun PDP classes involved in the experiment while in each table entry there is the obtained mutation score (the dash indicates that the mutation operator is not applicable to the Sun PDP class).
Relation: neutral
Domain: NeurIPS
Premise: This problem is reminiscent of the "class imbalance" problem in discriminatory modeling -the challenge however is exacerbated since there is not a single column to balance and the real data distribution should be kept intact.
Hypothesis: the goal is to resample efficiently in a way that all the categories from discrete attributes are sampled evenly (but not necessary uniformly) during the training process, and to recover the (not-resampled) real data distribution during test.
Relation: entailment
Domain: Hardware
Premise: Vuvuzela aims to provide point-to-point messaging between users in a way that is private in the face of a strong adversary, who can observe and tamper with the entire network and all but one of Vuvuzela's servers.
Hypothesis: an adversary should not be able to distinguish between a scenario where two particular users are communicating, and a scenario where they are not, even after interfering with the system.
Relation: entailment
Domain: NeurIPS
Premise: In this paper, we assume smoothness for f induced by the structure of a kernel on X .
Hypothesis: we make the standard assumption of a p.s.d. kernel k : X × X → R such that k(x, x) ≤ 1 for all x ∈ X , and f being an element of the reproducing kernel Hilbert space (RKHS) Hk(X ) of smooth real valued functions on X .
Relation: entailment
Domain: Security and privacy
Premise: When we merge all benchmark's results, about 30% of indirect branch targets are activated in total, slightly more than the result triggered by Octane 2.
Hypothesis: as can be seen, the address activation shows steep growth even at the end; on the other hand, it does not activate more target addresses com­pared to other input data sets, which trigger similar ECFG growth as 400.perlbench.
Relation: neutral
Domain: NeurIPS
Premise: In contrast to (Globerson et al. 2015, Foster et al. 2018), we study the sufficient conditions for exact recovery in polynomial time, and provide high probability results for general families of undirected connected graphs, which we consider to be a novel result to the best of our knowledge.
Hypothesis: we show that weak-expander graphs (e.g., grids) can be exactly recovered by adding small perturbations (edges coming from the Erdos-Rényi model with small probability).
Relation: entailment
Domain: Software and its engineering
Premise: Similarly, a distance 1 occurs in the case that there is only a single undecoded neighbor, which can then be recov­ered uniquely.
Hypothesis: a distance of 0 or 1 provides information about the recovery of neighbors that are part of a received linear combination, and thus they can be viewed as an ACK on a group of symbols (i.e., neighbors of the linear equation).
Relation: entailment
Domain: Networks
Premise: Stereo video (or 3D video) has attracted increasing interests in recent years, and there is a trend that a large portion of the stereo videos will be captured and consumed by mobile devices [1].
Hypothesis: several virtual reality (VR) head-mounted displays (HMDs), including Oculus Rift [4], Sony Morpheu [5] and Microsoft Hololens [3], will be available as full products in the early 2016. 
Relation: entailment
Domain: Security and privacy
Premise: Figure 14 show that FaceLive achieves the EER rate in the range of [7.2%,7.5%] when the detection of a single type of facial land­marks is unsuccessful and the coordinate information of the facial landmarks is missing.
Hypothesis: the missing localization of nose has a slightly more significant impact on FaceLive than the missing localization of eyes Figure 13: Face photos in ideal lighting condition and under illumination in varied environments [18] and mouth.
Relation: entailment
Domain: Security and privacy
Premise: All previous implementations of ECC for MSP430 processors used either a conventional Weierstraß curve (e.g. [20, 23, 27]) or a Montgomery curve of unreasonably large order (e.g. [10]), both of which wastes execution time and, thus, energy.
Hypothesis: our software supports Montgomery and Edwards curves over a 159 and a 191-bit prime field, which represents a good compromise between performance and security.
Relation: contrasting
Domain: Software and its engineering
Premise: However, after extracting the data from these SLRs, we found that 17 SLRs that did not report their quality assessment criteria inside the paper or somewhere available to public.
Hypothesis: we divided the 127 SLRs into two lists: 110 SLRs with explicit quality assessment criteria reported, listed in Appendix A, and the other 17 papers (without sufficient information about the quality assessment claimed to have been used) are listed in Appendix B.
Relation: reasoning
Domain: Hardware
Premise: Section 3.1 discusses how SLIPs are used to determine the insertion and movement of a line in a cache level.
Hypothesis: the latency for each operation (evaluating the energy of all the SLIPs and finding the minimum energy SLIP) was found to be 2 processor cycles at a processor clock rate of 2.4GHz and the throughput is one computation per cycle.
Relation: neutral
Domain: NeurIPS
Premise: We also evaluate the empirical robustness of our model around under two gradient-based attacks and two decision-based attacks: (i) PGD attack with CW loss [34,7], (ii) FGSM [47], (iii) Boundary attack (BA) [6], (iv) Point-wise attack (PA) [44].
Hypothesis: the gradient-based methods ((i) and (ii)) are done on the whole test dataset; the decision-based attacks ((iii) and (iv)) are done only on the first 100 test data points since they are expensive to run.
Relation: entailment
Domain: Software and its engineering
Premise: The non-matching column refers to the average number of blocks that: 1) are over-segmented by the MSoS, 2) have no correspondence with any block in the GT or they are not correctly labeled.
Hypothesis: we check the properties that can alter the static behavior of an HTML element, e.g., event listeners, and the HTML5 attributes that identify the role of an element, e.g., 'role'.
Relation: neutral
Domain: Networks
Premise: The DTS packet is used to announce the information update on code, transmit power, and queueing to neighboring nodes.
Hypothesis: we build a 7-node software-defined radio testbed and imple­ment a distributed algorithm that maximizes the secondary network throughput, while at the same time avoids inter­ference to primary users through joint Routing and cOde­waveform CHannelization (ROCH).
Relation: neutral
Domain: NeurIPS
Premise: We summarize our results in Table 5 and find that SSE-SE helps improving accuracy and BLEU scores on both dev and test sets in 10 out of 11 years from 2008 to 2018.
Hypothesis: on the last 5 years' test sets from 2014 to 2018, the transformer model with SSE-SE improves BLEU scores by 0.92 on average when compared to the baseline model without SSE-SE.
Relation: entailment
Domain: NeurIPS
Premise: Figure 4 shows that performance drops much more rapidly when heads are pruned from the Enc-Dec attention layers.
Hypothesis: pruning more than 60% of the Enc-Dec attention heads will result in catastrophic performance degradation, while the encoder and decoder self-attention layers can still produce reasonable translations (with BLEU scores around 30) with only 20% of the original attention heads.
Relation: entailment
Domain: NeurIPS
Premise: However, the dimensionality of this subspace is very low compared to the dimensionality of PreResNet-164 CIFAR-10â†’STL-10  the weight space, and we can not guarantee that SWAG variance estimates are adequate along all directions in weight space.
Hypothesis: we would expect SWAG to under-estimate the variances along random directions, as the SGD trajectory is in a low-dimensional subspace of the weight space, and a random vector has a close-to-zero projection on this subspace with high probability.
Relation: entailment
Domain: Hardware
Premise: In this section, we survey these systems, noting the effect that these choices have on overall size and power draw.
Hypothesis: we survey three commercial meters Kill-A-Watt [6], Watts Up [17], and Belkin Conserve Insight [3] and three research meters ACme [26] (two different versions), Monjolo [23], and Gemini [20] alongside PowerBlade (this work).
Relation: entailment
Domain: NeurIPS
Premise: The success of machine learning (ML) during the past decade has relied heavily on the rapid growth of computational power, new techniques training larger and more representative neural networks, and critically, the availability of enormous amounts of annotated data.
Hypothesis: new challenges have arisen with the move from cloud computing to edge computing and Internet of Things (IoT), and demands for customized models and local data privacy are increasing, which raise the question: how can a powerful model be trained for a specific user using only a limited number of local data?
Relation: contrasting
Domain: NeurIPS
Premise: As mentioned in [36], there are two disadvantages for median-of-means approach: (a) it involves an additional tuning parameter; (b) it is numerically unstable for small sample size.
Hypothesis: we identify a class of heavy-tailed bandits (sub-Weibull bandit) where mean estimators can still achieve regret bounds of the same order as those under sub-Gaussian reward distributions.
Relation: contrasting
Domain: Networks
Premise: At time 2, when the new subscription f3 occurs, RMCEP-Online is invoked again, which in turn calls RMCEP-Aprx with the subscriptions f2 (since e is not yet placed to satisfy f2) and f3.
Hypothesis: in each round of the algorithm, the chunk with the minimum AOC is selected, and added to the .nal solu­tion.
Relation: neutral
Domain: Security and privacy
Premise: The DNS authoritative servers can pose privacy threats because they are able to observe, collect, process, and transfer privacy-relevant DNS informa­tion (such as incoming DNS traffic) about clients either for the surveillance purposes of themselves or for facilitating an outside censor by passing him the data.
Hypothesis: the source IP address of client is of great interest to adversaries because it can be associated with the client s DNS messages to re.ect the end user s Internet activities.
Relation: entailment
Domain: Software and its engineering
Premise: In order to enable existing LLVM optimizations to apply to communication in PGAS programs, a PGAS programming language front-end needs to generate LLVM IR with the address space feature.
Hypothesis: the PGAS LLVM IR needs to include global pointers, which are an alternative way of representing a pointer to possibly remote memory and are recognizable by LLVM as pointer types, instead of the typical structure representation of wide pointers that include at least a node number and a local address.
Relation: entailment
Domain: Networks
Premise: The trace data were then divided into time intervals with a fixed length of 100 s. To quantify the effectiveness of using past bandwidth statistics to predict future values, we measured the bandwidth similarity of two vectors with PBA.
Hypothesis: we chose a set of intervals, the candidate prediction intervals, which ranged from 50 ms to 2.6 s in length and spaced 100 ms apart.
Relation: entailment
Domain: NeurIPS
Premise: This is different from the neural network literature [45,25], where adversarial training usually provides better LRTE and significantly better test error than methods providing provable robustness guarantees.
Hypothesis: our upper bound on the robust loss is tight and tractable and thus adversarial training should not be used as it provides only a lower bound and minimization of an upper bound makes more sense than minimization of a lower bound.
Relation: contrasting
Domain: Security and privacy
Premise: identification prior to (mutual) authentication is a problem that crops up in other systems as well, such as in e-passports [28] and RFID tags [29].
Hypothesis: 3.2 SIM card The SIM is extended to store the new shared secret key κ next to two PMSIs; the currently active PMSI (PMSI) and the future PMSI (Pnew).
Relation: neutral
Domain: Hardware
Premise: Since the specification items are tightly related each other and it is practically very time consuming to explore all feasible clock spine candidates, we solve the problem of clock spine synthesis by performing four steps.
Hypothesis: our proposed power-aware clock spine synthesis called CSPINE consists of four steps: (Step 1) Clustering clock sinks, (Step 2) Relaxing spines, (Step 3) Inserting spine buffers, and (Step 4) Constructing a top-level clock tree.
Relation: entailment
Domain: Security and privacy
Premise: The key insight is to maintain the invariant (Fact 2 in Appendix 9) that if some bucket in the real ORAM has an available slot, then during the post-processing of 1-ORAM, no blocks can be pushed through this bucket towards the root.
Hypothesis: to formalize this argument requires an intricate induction proof that is presented in Appendix 9.
Relation: contrasting
Domain: Software and its engineering
Premise: This way we achieved differentiated configurations in terms of the relation between the event execution granularity, and the granularity of the extra-ticks’ interval (recall this has been set to 100 microseconds).
Hypothesis: the adopted settings allowed us to determine different actual likelihoods for an extra-tick to interrupt an on going event (in fact such a likelihood is higher when the event granularity is greater), which gave us the possibility to assess our time-sharing architecture when changing the likelihood that a higher priority task can be detected as standing while the execution of an event is in progress.
Relation: entailment
Domain: NeurIPS
Premise: We draw data from two distribution families, the Normal family with mean a and variance b 2 , and the log-Normal family, with log-mean a log and log-variance b 2 log , under multiple parameter settings.
Hypothesis: we consider the impact of shifting the distribution location over [âˆ’40.0, 40.0], with small and large variance settings.
Relation: entailment
Domain: NeurIPS
Premise: As a first step to understand whether some heads are universally important, we perform the same ablation study on a second, out-of-domain test set.
Hypothesis: we consider the MNLI "mismatched" validation set for BERT and the MTNT English to French test set (Michel and Neubig, 2018) for the WMT model, both of which have been assembled for the very purpose of providing contrastive, out-of-domain test suites for their respective tasks.
Relation: entailment
Domain: Networks
Premise: These configuration and modification solutions may prevent a web site from being included in target pools of web scanners and mass-scale exploitation frameworks, but many individual practitioners would likely argue that such solutions rather represent the so-called security-by-obscurity.
Hypothesis: ultimately, (g) applied web intelligence research should be also able to demonstrate a concrete web deployment that successfully utilizes existing big data collections for analyzing real-world questions moti­vated by scholarly hypotheses.
Relation: neutral
Domain: Security and privacy
Premise: In case, such signals are transmitted in analog from, recovery must be possible from the analog form, presumably at a minimum after the signal has been attenuated, distorted and transformed in the process of transmission and reproduction.
Hypothesis: in the case of analog video signals with their high bandwidth requirements, the recovery must then either be possible given only a very limited high fidelity recording of the original signal, or from a significantly lower bandwidth recording at a later stage.
Relation: entailment
Domain: NeurIPS
Premise: We distinguish between two types of average potentials: the expected potential or true potential: and the average potential or empirical potential: The ultimate goal of the boosting algorithm is to minimize the expected potential, which determines the true error rate.
Hypothesis: most boosting algorithms, including XGBoost and LightGBM, focus on minimizing the empirical potential b (S T ), and rely on the limited capacity of the weak rules to guarantee that the true potential is also small.
Relation: contrasting
Domain: Networks
Premise: The term LAMP has retained its underlying rationale also in the 2000s and 2010s Internet, although the contemporary nomenclature allows shuffling; the letter P may currently refer also to Python or Perl, and MySQL may be replaced by PostgreSQL, for instance.
Hypothesis: lAMP is best understood as an idiom for a typical open source software stack for developing and servicing web sites.
Relation: entailment
Domain: Security and privacy
Premise: In an attempt to construct two-pass leakage-resilient AKE protocols based on the eCK model, three models and pro­tocols have been proposed: The first formalization was the Moriyama-Okamoto (MO) model [8] which allows bounded amount of leakage.
Hypothesis: adversary: The adversary M is a probabilistic polyno­mial time (PPT) algorithm which controls all interaction and communication between parties.
Relation: neutral