Di Zhang
commited on
Update README.md
Browse files
README.md
CHANGED
@@ -16,7 +16,7 @@ should probably proofread and complete it, then remove this comment. -->
|
|
16 |
|
17 |
# SimpleBerry/LLaMA-O1-Supervised-1129
|
18 |
|
19 |
-
This model is a fine-tuned version of [SimpleBerry/LLaMA-O1-Base-1127](https://huggingface.co/SimpleBerry/LLaMA-O1-Base-1127) on the [SimpleBerry/OpenLongCoT-SFT](SimpleBerry/OpenLongCoT-SFT) dataset.
|
20 |
|
21 |
# Inference
|
22 |
```Python
|
@@ -292,25 +292,15 @@ $$
|
|
292 |
└── \boxed{6}
|
293 |
```
|
294 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
295 |
|
296 |
-
```mermaid
|
297 |
-
graph TD
|
298 |
-
A[Problem: If Diana needs to bike 10 miles to reach home and she can bike at a speed of 3 mph for two hours before getting tired, and then at a speed of 1 mph until she reaches home, how long will it take her to get home?] --> B[Let's start by understanding the problem. Diana needs to bike a total of 10 miles, and we know her biking speeds at different stages. We will break down the problem into smaller parts: first, calculate the distance she can cover at her initial speed, then calculate the time taken at her slower speed to reach home.]
|
299 |
-
B --> C[First, we need to determine how far Diana can bike at her initial speed of 3 mph for 2 hours. This will help us understand how much distance she has covered before getting tired.]
|
300 |
-
C --> D[To find the distance covered at 3 mph for 2 hours, we use the formula: Distance = Speed × Time. Therefore, Distance = 3 mph × 2 hours = 6 miles.]
|
301 |
-
D --> E[Diana can cover 6 miles in the first 2 hours.]
|
302 |
-
B --> F[Now we need to determine how far Diana has left to bike after the first 2 hours. This will help us calculate the remaining time she needs to cover the remaining distance.]
|
303 |
-
F --> G[Diana has 10 miles total and has already biked 6 miles. Thus, the remaining distance is: 10 miles - 6 miles = 4 miles.]
|
304 |
-
G --> H[Diana has 4 miles left to bike.]
|
305 |
-
B --> I[Next, we need to calculate how long it will take Diana to bike the remaining 4 miles at her slower speed of 1 mph.]
|
306 |
-
I --> J[To find the time taken to cover the remaining distance at 1 mph, we use the formula: Time = Distance / Speed. Therefore, Time = 4 miles / 1 mph = 4 hours.]
|
307 |
-
J --> K[Diana will take 4 hours to bike the remaining 4 miles at her slower speed.]
|
308 |
-
B --> L[Now, we combine the time taken in both stages: 2 hours (initial speed) + 4 hours (slower speed) = 6 hours.]
|
309 |
-
L --> M[The total time it will take Diana to reach home is 6 hours.]
|
310 |
-
M --> N[Let's review the calculations to ensure accuracy. The distance covered at the initial speed and the time taken at the slower speed seem correct. The final addition of the times also checks out.]
|
311 |
-
M --> O[To enhance clarity, we can rephrase the conclusion to explicitly state the total biking time and the distance covered at each speed.]
|
312 |
-
O --> P[In conclusion, Diana will take a total of 6 hours to bike 10 miles, covering 6 miles in the first 2 hours at a speed of 3 mph and the remaining 4 miles at a speed of 1 mph, which takes an additional 4 hours.]
|
313 |
-
P --> Q[\boxed{6}]
|
314 |
-
|
315 |
-
class A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q positive
|
316 |
-
```
|
|
|
16 |
|
17 |
# SimpleBerry/LLaMA-O1-Supervised-1129
|
18 |
|
19 |
+
This model is a fine-tuned version of [SimpleBerry/LLaMA-O1-Base-1127](https://huggingface.co/SimpleBerry/LLaMA-O1-Base-1127) on the [SimpleBerry/OpenLongCoT-SFT](https://huggingface.co/datasets/SimpleBerry/OpenLongCoT-SFT) dataset.
|
20 |
|
21 |
# Inference
|
22 |
```Python
|
|
|
292 |
└── \boxed{6}
|
293 |
```
|
294 |
|
295 |
+
## Citations
|
296 |
+
Our ongoing related researches:
|
297 |
+
https://huggingface.co/papers/2406.07394
|
298 |
+
https://huggingface.co/papers/2410.02884
|
299 |
+
https://huggingface.co/papers/2411.18203
|
300 |
+
|
301 |
+
## Codes
|
302 |
+
https://github.com/SimpleBerry/LLaMA-O1
|
303 |
+
|
304 |
+
## License
|
305 |
+
MIT
|
306 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|