oliu-io commited on
Commit
3ec1a9d
·
verified ·
1 Parent(s): 2a8a833

Update README.md

Browse files
Files changed (1) hide show
  1. README.md +23 -2
README.md CHANGED
@@ -188,9 +188,30 @@ Introducing IsoBench, a benchmark dataset containing problems from four major ar
188
  <!-- Address questions around how the dataset is intended to be used. -->
189
  There are 4 major domains: math, algorithm, game, and science. Each domain has several subtasks. We will show how to load the data for each subtask.
190
 
191
- ### Mathematics
192
 
193
- [More Information Needed]
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
194
 
195
  ### Algorithms
196
  There are three algorithmic tasks, with ascending complexity: graph connectivity, graph maximum flow, and graph isomorphism.
 
188
  <!-- Address questions around how the dataset is intended to be used. -->
189
  There are 4 major domains: math, algorithm, game, and science. Each domain has several subtasks. We will show how to load the data for each subtask.
190
 
191
+ ### Direct Use
192
 
193
+ <!-- This section describes suitable use cases for the dataset. -->
194
+ IsoBench is designed with two objectives, which are:
195
+
196
+ - Analyzing the behavior difference between language-only and multimodal foundation models, by prompting them with distinct (*e.g.* mathematical expression and plot of a function) representations of the same input.
197
+ - Contributing a language-only/multimodal benchmark in the science domain.
198
+
199
+ For more information, be sure to checkout our [paper](https://arxiv.org/abs/2404.01266) and [project website](https://isobench.github.io/)!
200
+
201
+ #### Mathematics
202
+ There are three mathematics tasks. Each task is structured as a classification problem and each class contains 128 samples.
203
+
204
+ - Parity implements a ternary classification problem. A model has to classify an input function into an even function, odd function, or neither.
205
+ - Convexity implements a binary classification problem for a model to classify an input function as convex or concave. **Note**: some functions are only convex (resp. concave) within a certain domain (*e.g.* `x > 0`), which is report in the `xlim` field of each sample. We recommend providing this information as part of the prompt!
206
+ - Breakpoint counts the number of breakpoints (*i.e.* intersections of a piecewise linear function). Each function contains either 2 or 3 breakpoints, which renders this task a binary classification problem.
207
+
208
+ ```python
209
+ from datasets import load_dataset
210
+
211
+ dataset_connectivity = load_dataset('isobench/IsoBench', 'math_parity', split='validation')
212
+ dataset_maxflow = load_dataset('isobench/IsoBench', 'math_convexity', split='validation')
213
+ dataset_isomorphism = load_dataset('isobench/IsoBench', 'math_breakpoint', split='validation')
214
+ ```
215
 
216
  ### Algorithms
217
  There are three algorithmic tasks, with ascending complexity: graph connectivity, graph maximum flow, and graph isomorphism.