Add verifyToken field to verify evaluation results are produced by Hugging Face's automatic model evaluator (#2)

- Add verifyToken field to verify evaluation results are produced by Hugging Face's automatic model evaluator (b3dc64e9033fee10e40afc70931d8687a456c6ca)


Co-authored-by: Evaluation Bot <[email protected]>

README.md

@@ -1,10 +1,10 @@
 ---
 language:
 - en
+license: apache-2.0
 tags:
 - summarization
 - pegasus
-license: apache-2.0
 datasets:
 - kmfoda/booksum
 metrics:
@@ -23,39 +23,38 @@ widget:
     deviation of the average recurrence interval, the more specific could be the long
     term prediction of a future mainshock.
   example_title: earthquakes
-- text: " A typical feed-forward neural field algorithm. Spatiotemporal coordinates\
-    \ are fed into a neural network that predicts values in the reconstructed domain.\
-    \ Then, this domain is mapped to the sensor domain where sensor measurements are\
-    \ available as supervision. Class and Section Problems Addressed Generalization\
-    \ (Section 2) Inverse problems, ill-posed problems, editability; symmetries. Hybrid\
-    \ Representations (Section 3) Computation & memory efficiency, representation\
-    \ capacity, editability: Forward Maps (Section 4) Inverse problems Network Architecture\
-    \ (Section 5) Spectral bias, integration & derivatives. Manipulating Neural Fields\
-    \ (Section 6) Edit ability, constraints, regularization. Table 2: The five classes\
-    \ of techniques in the neural field toolbox each addresses problems that arise\
-    \ in learning, inference, and control. (Section 3). We can supervise reconstruction\
-    \ via differentiable forward maps that transform Or project our domain (e.g, 3D\
-    \ reconstruction via 2D images; Section 4) With appropriate network architecture\
-    \ choices, we can overcome neural network spectral biases (blurriness) and efficiently\
-    \ compute derivatives and integrals (Section 5). Finally, we can manipulate neural\
-    \ fields to add constraints and regularizations, and to achieve editable representations\
-    \ (Section 6). Collectively, these classes constitute a 'toolbox' of techniques\
-    \ to help solve problems with neural fields There are three components in a conditional\
-    \ neural field: (1) An encoder or inference function \u20AC that outputs the conditioning\
-    \ latent variable 2 given an observation 0 E(0) =2. 2 is typically a low-dimensional\
-    \ vector, and is often referred to aS a latent code Or feature code_ (2) A mapping\
-    \ function 4 between Z and neural field parameters O: Y(z) = O; (3) The neural\
-    \ field itself $. The encoder \u20AC finds the most probable z given the observations\
-    \ O: argmaxz P(2/0). The decoder maximizes the inverse conditional probability\
-    \ to find the most probable 0 given Z: arg- max P(Olz). We discuss different encoding\
-    \ schemes with different optimality guarantees (Section 2.1.1), both global and\
-    \ local conditioning (Section 2.1.2), and different mapping functions Y (Section\
-    \ 2.1.3) 2. Generalization Suppose we wish to estimate a plausible 3D surface\
-    \ shape given a partial or noisy point cloud. We need a suitable prior over the\
-    \ sur- face in its reconstruction domain to generalize to the partial observations.\
-    \ A neural network expresses a prior via the function space of its architecture\
-    \ and parameters 0, and generalization is influenced by the inductive bias of\
-    \ this function space (Section 5)."
+- text: ' A typical feed-forward neural field algorithm. Spatiotemporal coordinates
+    are fed into a neural network that predicts values in the reconstructed domain.
+    Then, this domain is mapped to the sensor domain where sensor measurements are
+    available as supervision. Class and Section Problems Addressed Generalization
+    (Section 2) Inverse problems, ill-posed problems, editability; symmetries. Hybrid
+    Representations (Section 3) Computation & memory efficiency, representation capacity,
+    editability: Forward Maps (Section 4) Inverse problems Network Architecture (Section
+    5) Spectral bias, integration & derivatives. Manipulating Neural Fields (Section
+    6) Edit ability, constraints, regularization. Table 2: The five classes of techniques
+    in the neural field toolbox each addresses problems that arise in learning, inference,
+    and control. (Section 3). We can supervise reconstruction via differentiable forward
+    maps that transform Or project our domain (e.g, 3D reconstruction via 2D images;
+    Section 4) With appropriate network architecture choices, we can overcome neural
+    network spectral biases (blurriness) and efficiently compute derivatives and integrals
+    (Section 5). Finally, we can manipulate neural fields to add constraints and regularizations,
+    and to achieve editable representations (Section 6). Collectively, these classes
+    constitute a ''toolbox'' of techniques to help solve problems with neural fields
+    There are three components in a conditional neural field: (1) An encoder or inference
+    function € that outputs the conditioning latent variable 2 given an observation
+    0 E(0) =2. 2 is typically a low-dimensional vector, and is often referred to aS
+    a latent code Or feature code_ (2) A mapping function 4 between Z and neural field
+    parameters O: Y(z) = O; (3) The neural field itself $. The encoder € finds the
+    most probable z given the observations O: argmaxz P(2/0). The decoder maximizes
+    the inverse conditional probability to find the most probable 0 given Z: arg-
+    max P(Olz). We discuss different encoding schemes with different optimality guarantees
+    (Section 2.1.1), both global and local conditioning (Section 2.1.2), and different
+    mapping functions Y (Section 2.1.3) 2. Generalization Suppose we wish to estimate
+    a plausible 3D surface shape given a partial or noisy point cloud. We need a suitable
+    prior over the sur- face in its reconstruction domain to generalize to the partial
+    observations. A neural network expresses a prior via the function space of its
+    architecture and parameters 0, and generalization is influenced by the inductive
+    bias of this function space (Section 5).'
   example_title: scientific paper
 - text: ' the big variety of data coming from diverse sources is one of the key properties
     of the big data phenomenon. It is, therefore, beneficial to understand how data
@@ -100,50 +99,62 @@ widget:
     in their business An important area of data analytics on the edge of corporate
     IT and the Internet is Web Analytics.'
   example_title: data science textbook
-- text: "Transformer-based models have shown to be very useful for many NLP tasks.\
-    \ However, a major limitation of transformers-based models is its O(n^2)O(n 2)\
-    \ time & memory complexity (where nn is sequence length). Hence, it's computationally\
-    \ very expensive to apply transformer-based models on long sequences n > 512n>512.\
-    \ Several recent papers, e.g. Longformer, Performer, Reformer, Clustered attention\
-    \ try to remedy this problem by approximating the full attention matrix. You can\
-    \ checkout \U0001F917's recent blog post in case you are unfamiliar with these\
-    \ models.\nBigBird (introduced in paper) is one of such recent models to address\
-    \ this issue. BigBird relies on block sparse attention instead of normal attention\
-    \ (i.e. BERT's attention) and can handle sequences up to a length of 4096 at a\
-    \ much lower computational cost compared to BERT. It has achieved SOTA on various\
-    \ tasks involving very long sequences such as long documents summarization, question-answering\
-    \ with long contexts.\nBigBird RoBERTa-like model is now available in \U0001F917\
-    Transformers. The goal of this post is to give the reader an in-depth understanding\
-    \ of big bird implementation & ease one's life in using BigBird with \U0001F917\
-    Transformers. But, before going into more depth, it is important to remember that\
-    \ the BigBird's attention is an approximation of BERT's full attention and therefore\
-    \ does not strive to be better than BERT's full attention, but rather to be more\
-    \ efficient. It simply allows to apply transformer-based models to much longer\
-    \ sequences since BERT's quadratic memory requirement quickly becomes unbearable.\
-    \ Simply put, if we would have \u221E compute & \u221E time, BERT's attention\
-    \ would be preferred over block sparse attention (which we are going to discuss\
-    \ in this post).\nIf you wonder why we need more compute when working with longer\
-    \ sequences, this blog post is just right for you!\nSome of the main questions\
-    \ one might have when working with standard BERT-like attention include:\nDo all\
-    \ tokens really have to attend to all other tokens? Why not compute attention\
-    \ only over important tokens? How to decide what tokens are important? How to\
-    \ attend to just a few tokens in a very efficient way? In this blog post, we will\
-    \ try to answer those questions.\nWhat tokens should be attended to? We will give\
-    \ a practical example of how attention works by considering the sentence 'BigBird\
-    \ is now available in HuggingFace for extractive question answering'. In BERT-like\
-    \ attention, every word would simply attend to all other tokens.\nLet's think\
-    \ about a sensible choice of key tokens that a queried token actually only should\
-    \ attend to by writing some pseudo-code. Will will assume that the token available\
-    \ is queried and build a sensible list of key tokens to attend to.\n>>> # let's\
-    \ consider following sentence as an example >>> example = ['BigBird', 'is', 'now',\
-    \ 'available', 'in', 'HuggingFace', 'for', 'extractive', 'question', 'answering']\n\
-    >>> # further let's assume, we're trying to understand the representation of 'available'\
-    \ i.e. >>> query_token = 'available' >>> # We will initialize an empty `set` and\
-    \ fill up the tokens of our interest as we proceed in this section. >>> key_tokens\
-    \ = [] # => currently 'available' token doesn't have anything to attend Nearby\
-    \ tokens should be important because, in a sentence (sequence of words), the current\
-    \ word is highly dependent on neighboring past & future tokens. This intuition\
-    \ is the idea behind the concept of sliding attention."
+- text: 'Transformer-based models have shown to be very useful for many NLP tasks.
+    However, a major limitation of transformers-based models is its O(n^2)O(n 2) time
+    & memory complexity (where nn is sequence length). Hence, it''s computationally
+    very expensive to apply transformer-based models on long sequences n > 512n>512.
+    Several recent papers, e.g. Longformer, Performer, Reformer, Clustered attention
+    try to remedy this problem by approximating the full attention matrix. You can
+    checkout 🤗''s recent blog post in case you are unfamiliar with these models.
+
+    BigBird (introduced in paper) is one of such recent models to address this issue.
+    BigBird relies on block sparse attention instead of normal attention (i.e. BERT''s
+    attention) and can handle sequences up to a length of 4096 at a much lower computational
+    cost compared to BERT. It has achieved SOTA on various tasks involving very long
+    sequences such as long documents summarization, question-answering with long contexts.
+
+    BigBird RoBERTa-like model is now available in 🤗Transformers. The goal of this
+    post is to give the reader an in-depth understanding of big bird implementation
+    & ease one''s life in using BigBird with 🤗Transformers. But, before going into
+    more depth, it is important to remember that the BigBird''s attention is an approximation
+    of BERT''s full attention and therefore does not strive to be better than BERT''s
+    full attention, but rather to be more efficient. It simply allows to apply transformer-based
+    models to much longer sequences since BERT''s quadratic memory requirement quickly
+    becomes unbearable. Simply put, if we would have ∞ compute & ∞ time, BERT''s attention
+    would be preferred over block sparse attention (which we are going to discuss
+    in this post).
+
+    If you wonder why we need more compute when working with longer sequences, this
+    blog post is just right for you!
+
+    Some of the main questions one might have when working with standard BERT-like
+    attention include:
+
+    Do all tokens really have to attend to all other tokens? Why not compute attention
+    only over important tokens? How to decide what tokens are important? How to attend
+    to just a few tokens in a very efficient way? In this blog post, we will try to
+    answer those questions.
+
+    What tokens should be attended to? We will give a practical example of how attention
+    works by considering the sentence ''BigBird is now available in HuggingFace for
+    extractive question answering''. In BERT-like attention, every word would simply
+    attend to all other tokens.
+
+    Let''s think about a sensible choice of key tokens that a queried token actually
+    only should attend to by writing some pseudo-code. Will will assume that the token
+    available is queried and build a sensible list of key tokens to attend to.
+
+    >>> # let''s consider following sentence as an example >>> example = [''BigBird'',
+    ''is'', ''now'', ''available'', ''in'', ''HuggingFace'', ''for'', ''extractive'',
+    ''question'', ''answering'']
+
+    >>> # further let''s assume, we''re trying to understand the representation of
+    ''available'' i.e. >>> query_token = ''available'' >>> # We will initialize an
+    empty `set` and fill up the tokens of our interest as we proceed in this section.
+    >>> key_tokens = [] # => currently ''available'' token doesn''t have anything
+    to attend Nearby tokens should be important because, in a sentence (sequence of
+    words), the current word is highly dependent on neighboring past & future tokens.
+    This intuition is the idea behind the concept of sliding attention.'
   example_title: bigbird blog intro
 inference:
   parameters:
@@ -166,30 +177,36 @@ model-index:
       config: kmfoda--booksum
       split: test
     metrics:
-    - name: ROUGE-1
-      type: rouge
+    - type: rouge
       value: 29.1023
+      name: ROUGE-1
       verified: true
-    - name: ROUGE-2
-      type: rouge
+      verifyToken: eyJhbGciOiJFZERTQSIsInR5cCI6IkpXVCJ9.eyJoYXNoIjoiYTFhNjg4YTFlODU5MmVjNGVmNDRmMjQ4M2YyZGNmMWRlYjBhZmVhMTY3ZTUxNDkzNjY0OGVmNWJlNmY1OTkzNCIsInZlcnNpb24iOjF9.E_rVKqB7WEerLeRq6JIVTLZ1TgmsThFQJVKh11WH1qWa-cL3766psPWDKe8mK3lNkjmwbiDW0DZlDt4dm2ATCA
+    - type: rouge
       value: 6.2441
+      name: ROUGE-2
       verified: true
-    - name: ROUGE-L
-      type: rouge
+      verifyToken: eyJhbGciOiJFZERTQSIsInR5cCI6IkpXVCJ9.eyJoYXNoIjoiNDVmZmFlOTgwN2Q3ZWRkZGVkMzU1ZDRkYzU1MWMzMTk1NDM5YTU0MzFjNDljNmZlY2I2NjZmZjcyYjBkZGExZCIsInZlcnNpb24iOjF9.QnuGoMWX8cq5_ukRtiaLRLau_F9XiCjg313GC7Iu1VGK8Kj_9lzU43377VsH0fBWooA1zJjtIK0UA-YpGQQOAA
+    - type: rouge
       value: 14.7503
+      name: ROUGE-L
       verified: true
-    - name: ROUGE-LSUM
-      type: rouge
+      verifyToken: eyJhbGciOiJFZERTQSIsInR5cCI6IkpXVCJ9.eyJoYXNoIjoiMzJhNzE0YjZiZWQ4NDE1Yjg3ZGJjY2ZmYWEwYzU5MTRhYWNiNTcyODU1NzM5NTZhNjNlNmYwNDVlYmZmYjkxOCIsInZlcnNpb24iOjF9.m5BLUMefXa1KivIIE9-gYKYq5aRRbfpQWazqzXxfCsqqp38Lt0ymk6OwXSlQyB_5oksNHIDFKpJX4wjYx2i7Bw
+    - type: rouge
       value: 27.2375
+      name: ROUGE-LSUM
       verified: true
-    - name: loss
-      type: loss
+      verifyToken: eyJhbGciOiJFZERTQSIsInR5cCI6IkpXVCJ9.eyJoYXNoIjoiMTY1OTIxMzBkMGJiZmNiNjZjYmQ2MjUwMjBkYTg5Zjc1NjVlZjllNTg0MDM1NTdhZDJlZmIwOTczOGNkZDc5YyIsInZlcnNpb24iOjF9.bThI16mvqhEuGBhdao0w8j03vv9G9Quy-ITRZzalr41zOour9it4oxEPFCvmPf-nLCQkqgWKUDEzgr6Ww8qgBg
+    - type: loss
       value: 2.979011058807373
+      name: loss
       verified: true
-    - name: gen_len
-      type: gen_len
+      verifyToken: eyJhbGciOiJFZERTQSIsInR5cCI6IkpXVCJ9.eyJoYXNoIjoiOGM0NzM3YTI4Njg4NDY0ZjQzNTZmYTIxYzcxNDBlNzAwNTAxNDE4MTZjYmZmNzYwODU0OWQ1ZjM5YjRmMmFkZiIsInZlcnNpb24iOjF9.EPEP53AoqHz0rjVGStJI2dM7ivxFmOj572I3llWdAoejm3zO1Iq5WDArYsqOse_oLxYCgcqPmNVc5IcLW9x7Dg
+    - type: gen_len
       value: 467.269
+      name: gen_len
       verified: true
+      verifyToken: eyJhbGciOiJFZERTQSIsInR5cCI6IkpXVCJ9.eyJoYXNoIjoiNjgzYzU2ZjkwN2RhNzJlZmQyZTBlYmUxMTZhNzg0ODMwMjA3OTUzNTIwOWFkZWVmNjVmMTJiZmZhNWFmY2UzZCIsInZlcnNpb24iOjF9.RW5tzk2fcc_m4bgaSopRDFhSR9R8hRaYKrstXH4X5iGP_Xwvhy5Q7-igd2ACnlxIfmtdTmMxLMsvHr5oAZEwDg
 ---