EtashGuha commited on
Commit
8fda002
·
verified ·
1 Parent(s): d9bdce0

Upload configuration file

Browse files
config/instruction_filtering_askllm.yaml ADDED
@@ -0,0 +1,54 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ operators:
2
+ - id: seed_math_load_in
3
+ config:
4
+ type: load_preexisting
5
+ framework_name: seed_math_load_in
6
+ - id: sample_dataset
7
+ config:
8
+ type: function
9
+ function: data_strategies.commons.uniform_sample_fixed
10
+ function_config:
11
+ num_samples: 3
12
+ input_ids:
13
+ - seed_math_load_in
14
+ - id: annotate
15
+ config:
16
+ type: completions
17
+ map: binary_classifier
18
+ map_config:
19
+ user_message: |
20
+ I want you to judge whether the following question is like the positive examples provided (TRUE) or like the negative examples (FALSE). Here are a few positive examples of questions:
21
+
22
+ Positive Questions
23
+ 1. A plane contains $40$ lines, no $2$ of which are parallel. Suppose that there are $3$ points where exactly $3$ lines intersect, $4$ points where exactly $4$ lines intersect, $5$ points where exactly $5$ lines intersect, $6$ points where exactly $6$ lines intersect, and no points where more than $6$ lines intersect. Find the number of points where exactly $2$ lines intersect.
24
+ 2. A spin-half particle is in a linear superposition0.8|\uparrow\rangle+0.6|\downarrow\rangle of its spin-up and spin-down states. If |\uparrow\rangle and |\downarrow\rangle are the eigenstates of \sigma_{z} , then what is the expectation value up to one decimal place, of the operator 10\sigma_{z}+5\sigma_{x} ? Here, symbols have their usual meanings.
25
+ 3. An established group of scientists are working on finding solution to NP hard problems. They claim Subset Sum as an NP-hard problem. The problem is to determine whether there exists a subset of a given set S whose sum is a given number K. You are a computer engineer and you claim to solve this problem given that all numbers in the set are non-negative. Given a set S of size N of non-negative integers, find whether there exists a subset whose sum is K. Input First line of input contains T, the number of test cases. T test cases follow. Each test case contains 2 lines. First line contains two integers N and K. Next line contains N space separated non-negative integers (each less than 100000). 0 < T < 1000 0 < N < 1000 0 < K < 1000 Output Output T lines, one for each test case. Every line should be either 0 or 1 depending on whether such a subset exists or not. Example Input: 2 5 10 3 4 6 1 9 3 2 1 3 4 Output: 1 0
26
+ 4. Let $S$ be the set of positive integer divisors of $20^9.$ Three numbers are chosen independently and at random with replacement from the set $S$ and labeled $a_1,a_2,$ and $a_3$ in the order they are chosen. The probability that both $a_1$ divides $a_2$ and $a_2$ divides $a_3$ is $\tfrac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m.$
27
+ 5. What is the concentration of calcium ions in a solution containing 0.02 M stochiometric Ca-EDTA complex (we assume that the pH is ideal, T = 25 °C). KCa-EDTA = 5x10^10.
28
+
29
+ Negative Questions:
30
+ 1. Solve 0 = 19*z - 17*z for z.
31
+ 2. Simplify ((-2*(-2*sqrt(1210) - sqrt(1210) - sqrt(20)/sqrt(2)*-6))/((sqrt(1800)*2 + sqrt(1800) + sqrt(1800) + sqrt(1800))*-1)*3)**2.\n
32
+ 3. Given a list of objects that have an `is_organized` method that returns a boolean value, write a Python function that takes the list and returns a new list of those objects for which `is_organized` returns True.
33
+ 4. Can you provide a Python code snippet that demonstrates how to use a decorator to log the execution time of a function?
34
+ 5. Is sodium hydroxide (NaOH) an acid or base?
35
+
36
+ Here is your question:
37
+ {{instruction_seed}}
38
+
39
+ Return True if it is like the positive questions and return False if it is like the negative questions.
40
+ output_column: to_be_used
41
+ model: "gpt-4o-mini"
42
+ batch: False
43
+ temperature: 1.0
44
+ input_ids:
45
+ - sample_dataset
46
+ # - id: select_to_be_used
47
+ # config:
48
+ # type: function
49
+ # function: data_strategies.commons.select_rows
50
+ # function_config:
51
+ # conditions:
52
+ # to_be_used: True
53
+ # input_ids:
54
+ # - annotate