Add evaluation results on the kmfoda--booksum config of kmfoda/booksum
#1
by
autoevaluator
HF staff
- opened
README.md
CHANGED
@@ -1,5 +1,4 @@
|
|
1 |
---
|
2 |
-
|
3 |
language:
|
4 |
- en
|
5 |
tags:
|
@@ -11,13 +10,96 @@ datasets:
|
|
11 |
metrics:
|
12 |
- rouge
|
13 |
widget:
|
14 |
-
- text:
|
15 |
-
|
16 |
-
|
17 |
-
|
18 |
-
|
19 |
-
|
20 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
21 |
inference:
|
22 |
parameters:
|
23 |
max_length: 64
|
@@ -26,8 +108,43 @@ inference:
|
|
26 |
repetition_penalty: 2.4
|
27 |
length_penalty: 0.5
|
28 |
num_beams: 4
|
29 |
-
early_stopping:
|
30 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
31 |
---
|
32 |
|
33 |
|
|
|
1 |
---
|
|
|
2 |
language:
|
3 |
- en
|
4 |
tags:
|
|
|
10 |
metrics:
|
11 |
- rouge
|
12 |
widget:
|
13 |
+
- text: large earthquakes along a given fault segment do not occur at random intervals
|
14 |
+
because it takes time to accumulate the strain energy for the rupture. The rates
|
15 |
+
at which tectonic plates move and accumulate strain at their boundaries are approximately
|
16 |
+
uniform. Therefore, in first approximation, one may expect that large ruptures
|
17 |
+
of the same fault segment will occur at approximately constant time intervals.
|
18 |
+
If subsequent main shocks have different amounts of slip across the fault, then
|
19 |
+
the recurrence time may vary, and the basic idea of periodic mainshocks must be
|
20 |
+
modified. For great plate boundary ruptures the length and slip often vary by
|
21 |
+
a factor of 2. Along the southern segment of the San Andreas fault the recurrence
|
22 |
+
interval is 145 years with variations of several decades. The smaller the standard
|
23 |
+
deviation of the average recurrence interval, the more specific could be the long
|
24 |
+
term prediction of a future mainshock.
|
25 |
+
example_title: earthquakes
|
26 |
+
- text: " A typical feed-forward neural field algorithm. Spatiotemporal coordinates\
|
27 |
+
\ are fed into a neural network that predicts values in the reconstructed domain.\
|
28 |
+
\ Then, this domain is mapped to the sensor domain where sensor measurements are\
|
29 |
+
\ available as supervision. Class and Section Problems Addressed Generalization\
|
30 |
+
\ (Section 2) Inverse problems, ill-posed problems, editability; symmetries. Hybrid\
|
31 |
+
\ Representations (Section 3) Computation & memory efficiency, representation\
|
32 |
+
\ capacity, editability: Forward Maps (Section 4) Inverse problems Network Architecture\
|
33 |
+
\ (Section 5) Spectral bias, integration & derivatives. Manipulating Neural Fields\
|
34 |
+
\ (Section 6) Edit ability, constraints, regularization. Table 2: The five classes\
|
35 |
+
\ of techniques in the neural field toolbox each addresses problems that arise\
|
36 |
+
\ in learning, inference, and control. (Section 3). We can supervise reconstruction\
|
37 |
+
\ via differentiable forward maps that transform Or project our domain (e.g, 3D\
|
38 |
+
\ reconstruction via 2D images; Section 4) With appropriate network architecture\
|
39 |
+
\ choices, we can overcome neural network spectral biases (blurriness) and efficiently\
|
40 |
+
\ compute derivatives and integrals (Section 5). Finally, we can manipulate neural\
|
41 |
+
\ fields to add constraints and regularizations, and to achieve editable representations\
|
42 |
+
\ (Section 6). Collectively, these classes constitute a 'toolbox' of techniques\
|
43 |
+
\ to help solve problems with neural fields There are three components in a conditional\
|
44 |
+
\ neural field: (1) An encoder or inference function \u20AC that outputs the conditioning\
|
45 |
+
\ latent variable 2 given an observation 0 E(0) =2. 2 is typically a low-dimensional\
|
46 |
+
\ vector, and is often referred to aS a latent code Or feature code_ (2) A mapping\
|
47 |
+
\ function 4 between Z and neural field parameters O: Y(z) = O; (3) The neural\
|
48 |
+
\ field itself $. The encoder \u20AC finds the most probable z given the observations\
|
49 |
+
\ O: argmaxz P(2/0). The decoder maximizes the inverse conditional probability\
|
50 |
+
\ to find the most probable 0 given Z: arg- max P(Olz). We discuss different encoding\
|
51 |
+
\ schemes with different optimality guarantees (Section 2.1.1), both global and\
|
52 |
+
\ local conditioning (Section 2.1.2), and different mapping functions Y (Section\
|
53 |
+
\ 2.1.3) 2. Generalization Suppose we wish to estimate a plausible 3D surface\
|
54 |
+
\ shape given a partial or noisy point cloud. We need a suitable prior over the\
|
55 |
+
\ sur- face in its reconstruction domain to generalize to the partial observations.\
|
56 |
+
\ A neural network expresses a prior via the function space of its architecture\
|
57 |
+
\ and parameters 0, and generalization is influenced by the inductive bias of\
|
58 |
+
\ this function space (Section 5)."
|
59 |
+
example_title: scientific paper
|
60 |
+
- text: ' the big variety of data coming from diverse sources is one of the key properties
|
61 |
+
of the big data phenomenon. It is, therefore, beneficial to understand how data
|
62 |
+
is generated in various environments and scenarios, before looking at what should
|
63 |
+
be done with this data and how to design the best possible architecture to accomplish
|
64 |
+
this The evolution of IT architectures, described in Chapter 2, means that the
|
65 |
+
data is no longer processed by a few big monolith systems, but rather by a group
|
66 |
+
of services In parallel to the processing layer, the underlying data storage has
|
67 |
+
also changed and became more distributed This, in turn, required a significant
|
68 |
+
paradigm shift as the traditional approach to transactions (ACID) could no longer
|
69 |
+
be supported. On top of this, cloud computing is becoming a major approach with
|
70 |
+
the benefits of reducing costs and providing on-demand scalability but at the
|
71 |
+
same time introducing concerns about privacy, data ownership, etc In the meantime
|
72 |
+
the Internet continues its exponential growth: Every day both structured and unstructured
|
73 |
+
data is published and available for processing: To achieve competitive advantage
|
74 |
+
companies have to relate their corporate resources to external services, e.g.
|
75 |
+
financial markets, weather forecasts, social media, etc While several of the sites
|
76 |
+
provide some sort of API to access the data in a more orderly fashion; countless
|
77 |
+
sources require advanced web mining and Natural Language Processing (NLP) processing
|
78 |
+
techniques: Advances in science push researchers to construct new instruments
|
79 |
+
for observing the universe O conducting experiments to understand even better
|
80 |
+
the laws of physics and other domains. Every year humans have at their disposal
|
81 |
+
new telescopes, space probes, particle accelerators, etc These instruments generate
|
82 |
+
huge streams of data, which need to be stored and analyzed. The constant drive
|
83 |
+
for efficiency in the industry motivates the introduction of new automation techniques
|
84 |
+
and process optimization: This could not be done without analyzing the precise
|
85 |
+
data that describe these processes. As more and more human tasks are automated,
|
86 |
+
machines provide rich data sets, which can be analyzed in real-time to drive efficiency
|
87 |
+
to new levels. Finally, it is now evident that the growth of the Internet of Things
|
88 |
+
is becoming a major source of data. More and more of the devices are equipped
|
89 |
+
with significant computational power and can generate a continuous data stream
|
90 |
+
from their sensors. In the subsequent sections of this chapter, we will look at
|
91 |
+
the domains described above to see what they generate in terms of data sets. We
|
92 |
+
will compare the volumes but will also look at what is characteristic and important
|
93 |
+
from their respective points of view. 3.1 The Internet is undoubtedly the largest
|
94 |
+
database ever created by humans. While several well described; cleaned, and structured
|
95 |
+
data sets have been made available through this medium, most of the resources
|
96 |
+
are of an ambiguous, unstructured, incomplete or even erroneous nature. Still,
|
97 |
+
several examples in the areas such as opinion mining, social media analysis, e-governance,
|
98 |
+
etc, clearly show the potential lying in these resources. Those who can successfully
|
99 |
+
mine and interpret the Internet data can gain unique insight and competitive advantage
|
100 |
+
in their business An important area of data analytics on the edge of corporate
|
101 |
+
IT and the Internet is Web Analytics.'
|
102 |
+
example_title: data science textbook
|
103 |
inference:
|
104 |
parameters:
|
105 |
max_length: 64
|
|
|
108 |
repetition_penalty: 2.4
|
109 |
length_penalty: 0.5
|
110 |
num_beams: 4
|
111 |
+
early_stopping: true
|
112 |
+
model-index:
|
113 |
+
- name: pszemraj/pegasus-large-book-summary
|
114 |
+
results:
|
115 |
+
- task:
|
116 |
+
type: summarization
|
117 |
+
name: Summarization
|
118 |
+
dataset:
|
119 |
+
name: kmfoda/booksum
|
120 |
+
type: kmfoda/booksum
|
121 |
+
config: kmfoda--booksum
|
122 |
+
split: test
|
123 |
+
metrics:
|
124 |
+
- name: ROUGE-1
|
125 |
+
type: rouge
|
126 |
+
value: 29.9119
|
127 |
+
verified: true
|
128 |
+
- name: ROUGE-2
|
129 |
+
type: rouge
|
130 |
+
value: 6.1923
|
131 |
+
verified: true
|
132 |
+
- name: ROUGE-L
|
133 |
+
type: rouge
|
134 |
+
value: 14.9786
|
135 |
+
verified: true
|
136 |
+
- name: ROUGE-LSUM
|
137 |
+
type: rouge
|
138 |
+
value: 28.0299
|
139 |
+
verified: true
|
140 |
+
- name: loss
|
141 |
+
type: loss
|
142 |
+
value: 3.0345687866210938
|
143 |
+
verified: true
|
144 |
+
- name: gen_len
|
145 |
+
type: gen_len
|
146 |
+
value: 427.3899
|
147 |
+
verified: true
|
148 |
---
|
149 |
|
150 |
|