Text Generation
Transformers
Safetensors
qwen3
Generated from Trainer
trl
sft
conversational
text-generation-inference
Instructions to use cs-552-2026-MandMP/math_model with libraries, inference providers, notebooks, and local apps. Follow these links to get started.
- Libraries
- Transformers
How to use cs-552-2026-MandMP/math_model with Transformers:
# Use a pipeline as a high-level helper from transformers import pipeline pipe = pipeline("text-generation", model="cs-552-2026-MandMP/math_model") messages = [ {"role": "user", "content": "Who are you?"}, ] pipe(messages)# Load model directly from transformers import AutoTokenizer, AutoModelForCausalLM tokenizer = AutoTokenizer.from_pretrained("cs-552-2026-MandMP/math_model") model = AutoModelForCausalLM.from_pretrained("cs-552-2026-MandMP/math_model", device_map="auto") messages = [ {"role": "user", "content": "Who are you?"}, ] inputs = tokenizer.apply_chat_template( messages, add_generation_prompt=True, tokenize=True, return_dict=True, return_tensors="pt", ).to(model.device) outputs = model.generate(**inputs, max_new_tokens=40) print(tokenizer.decode(outputs[0][inputs["input_ids"].shape[-1]:])) - Notebooks
- Google Colab
- Kaggle
- Local Apps Settings
- vLLM
How to use cs-552-2026-MandMP/math_model with vLLM:
Install from pip and serve model
# Install vLLM from pip: pip install vllm # Start the vLLM server: vllm serve "cs-552-2026-MandMP/math_model" # Call the server using curl (OpenAI-compatible API): curl -X POST "http://localhost:8000/v1/chat/completions" \ -H "Content-Type: application/json" \ --data '{ "model": "cs-552-2026-MandMP/math_model", "messages": [ { "role": "user", "content": "What is the capital of France?" } ] }'Use Docker
docker model run hf.co/cs-552-2026-MandMP/math_model
- SGLang
How to use cs-552-2026-MandMP/math_model with SGLang:
Install from pip and serve model
# Install SGLang from pip: pip install sglang # Start the SGLang server: python3 -m sglang.launch_server \ --model-path "cs-552-2026-MandMP/math_model" \ --host 0.0.0.0 \ --port 30000 # Call the server using curl (OpenAI-compatible API): curl -X POST "http://localhost:30000/v1/chat/completions" \ -H "Content-Type: application/json" \ --data '{ "model": "cs-552-2026-MandMP/math_model", "messages": [ { "role": "user", "content": "What is the capital of France?" } ] }'Use Docker images
docker run --gpus all \ --shm-size 32g \ -p 30000:30000 \ -v ~/.cache/huggingface:/root/.cache/huggingface \ --env "HF_TOKEN=<secret>" \ --ipc=host \ lmsysorg/sglang:latest \ python3 -m sglang.launch_server \ --model-path "cs-552-2026-MandMP/math_model" \ --host 0.0.0.0 \ --port 30000 # Call the server using curl (OpenAI-compatible API): curl -X POST "http://localhost:30000/v1/chat/completions" \ -H "Content-Type: application/json" \ --data '{ "model": "cs-552-2026-MandMP/math_model", "messages": [ { "role": "user", "content": "What is the capital of France?" } ] }' - Docker Model Runner
How to use cs-552-2026-MandMP/math_model with Docker Model Runner:
docker model run hf.co/cs-552-2026-MandMP/math_model
Automated MNLP evaluation report (2026-05-21)
#5
by zechen-nlp - opened
- EVAL_REPORT.md +25 -79
EVAL_REPORT.md
CHANGED
|
@@ -2,7 +2,7 @@
|
|
| 2 |
|
| 3 |
- **Model repo:** [`cs-552-2026-MandMP/math_model`](https://huggingface.co/cs-552-2026-MandMP/math_model)
|
| 4 |
- **Owner(s):** group **MandMP**
|
| 5 |
-
- **Generated at:** 2026-05-
|
| 6 |
- **Pipeline:** [mnlp-project-ci](https://github.com/eric11eca/mnlp-project-ci)
|
| 7 |
|
| 8 |
_This PR is opened automatically by the course CI. It is **non-blocking** — you do not need to merge it. The next nightly run will refresh this file._
|
|
@@ -11,7 +11,7 @@ _This PR is opened automatically by the course CI. It is **non-blocking** — yo
|
|
| 11 |
|
| 12 |
| Benchmark | Accuracy | Status |
|
| 13 |
|---|---:|---|
|
| 14 |
-
| Math | 0.
|
| 15 |
| Knowledge | — | not run |
|
| 16 |
| Multilingual | — | not run |
|
| 17 |
| Safety | — | not run |
|
|
@@ -30,112 +30,58 @@ _Prompts are intentionally omitted to avoid revealing benchmark contents. For mu
|
|
| 30 |
- **completion**:
|
| 31 |
|
| 32 |
```text
|
| 33 |
-
Okay, so I need to solve the equation 10^x minus 10 equals 9990. Let me write that down first to make sure I have it right: 10^x - 10 = 9990. Alright, so my goal is to find the value of x that
|
| 34 |
|
| 35 |
-
Hmm, let me think. I
|
| 36 |
|
| 37 |
-
... [truncated
|
| 38 |
-
|
| 39 |
-
ation: 10^x - 10 = 9990
|
| 40 |
-
|
| 41 |
-
Add 10 to both sides: 10^x = 10,000
|
| 42 |
-
|
| 43 |
-
Recognize that 10,000 is 10^4, so x = 4
|
| 44 |
-
|
| 45 |
-
Check by substitution: 10^4 - 10 = 10,000 - 10 = 9,990, which matches the right side.
|
| 46 |
-
|
| 47 |
-
Therefore, all steps are consistent and correct.
|
| 48 |
-
|
| 49 |
-
I think that's thorough enough. I don't see any mistakes in my reasoning, and the answer checks out when substituted back into the original equation. So, I think x = 4 is the correct solution.
|
| 50 |
-
|
| 51 |
-
**Final Answer**
|
| 52 |
-
The solution is \boxed{4}.
|
| 53 |
-
</think>
|
| 54 |
-
|
| 55 |
-
To solve the equation:
|
| 56 |
-
|
| 57 |
-
$$
|
| 58 |
-
10^x - 10 = 9990
|
| 59 |
-
$$
|
| 60 |
-
|
| 61 |
-
---
|
| 62 |
|
| 63 |
-
|
| 64 |
|
| 65 |
-
|
| 66 |
|
| 67 |
-
|
| 68 |
-
10^x - 10 + 10 = 9990 + 10
|
| 69 |
-
$$
|
| 70 |
|
| 71 |
-
|
| 72 |
-
10^x = 10,000
|
| 73 |
-
$$
|
| 74 |
|
| 75 |
-
-
|
| 76 |
|
| 77 |
-
|
| 78 |
|
| 79 |
-
|
| 80 |
|
| 81 |
-
|
| 82 |
-
10^x = 10,000
|
| 83 |
-
$$
|
| 84 |
|
| 85 |
-
|
| 86 |
|
| 87 |
-
|
| 88 |
-
x = 4
|
| 89 |
-
$$
|
| 90 |
|
| 91 |
-
|
| 92 |
|
| 93 |
-
|
| 94 |
|
| 95 |
-
|
| 96 |
-
|
| 97 |
-
|
| 98 |
-
10^4 - 10 = 10,000 - 10 = 9,990
|
| 99 |
-
$$
|
| 100 |
-
|
| 101 |
-
This matches the right-hand side of the original equation, confirming that the solution is correct.
|
| 102 |
-
|
| 103 |
-
---
|
| 104 |
-
|
| 105 |
-
### Final Answer
|
| 106 |
|
| 107 |
-
$$
|
| 108 |
\boxed{4}
|
| 109 |
-
$$
|
| 110 |
```
|
| 111 |
|
| 112 |
**Incorrect** (1 shown)
|
| 113 |
|
| 114 |
-
- **reference**: `
|
| 115 |
- **overall** (0/8 completions correct)
|
| 116 |
- **extracted** (✗): `<no answer>`
|
| 117 |
- **completion**:
|
| 118 |
|
| 119 |
```text
|
| 120 |
-
Okay, so I need to find the
|
| 121 |
-
|
| 122 |
-
First, let me parse the problem. The variables are $a_1$ through $a_{2024}$, with $a_0 = 0$. The condition is that each subsequent term is at least twice the
|
| 123 |
|
| 124 |
... [truncated 823 chars] ...
|
| 125 |
|
| 126 |
-
|
| 127 |
-
|
| 128 |
-
So, for n=2024, there are 2023 terms. So, the problem is for n=2024, with 2023 terms.
|
| 129 |
-
|
| 130 |
-
But in my earlier examples with n=2 and n=3, the maximum was achieved when the sequence was constant.
|
| 131 |
-
|
| 132 |
-
But let me think again. Suppose that for some i, we make b_{i+1} larger than b_i, then we have to make b_{i+2} larger than b_{i+1}, etc., which would make the subsequent terms smaller. However, if we make some b_i's larger and some smaller? But since the sequence must be non-decreasing, we can't make some b_i's smaller.
|
| 133 |
-
|
| 134 |
-
Therefore, the only way to maximize the sum is to have all the b_i's equal.
|
| 135 |
-
|
| 136 |
-
But let me think again. Suppose that for some i, we have b_{i+1} = b_i, and for other terms, b_{i+1} is larger. But since the sequence is non-decreasing, once we have b_{i+1} larger than b_i, we can't make it smaller. Therefore, the sequence is non-decreasing, so if we have some b_i's equal, and others larger, but the sum would be less than if all are equal.
|
| 137 |
|
| 138 |
-
|
| 139 |
|
| 140 |
-
|
| 141 |
```
|
|
|
|
| 2 |
|
| 3 |
- **Model repo:** [`cs-552-2026-MandMP/math_model`](https://huggingface.co/cs-552-2026-MandMP/math_model)
|
| 4 |
- **Owner(s):** group **MandMP**
|
| 5 |
+
- **Generated at:** 2026-05-21T03:28:21+00:00 (UTC)
|
| 6 |
- **Pipeline:** [mnlp-project-ci](https://github.com/eric11eca/mnlp-project-ci)
|
| 7 |
|
| 8 |
_This PR is opened automatically by the course CI. It is **non-blocking** — you do not need to merge it. The next nightly run will refresh this file._
|
|
|
|
| 11 |
|
| 12 |
| Benchmark | Accuracy | Status |
|
| 13 |
|---|---:|---|
|
| 14 |
+
| Math | 0.1400 | ok |
|
| 15 |
| Knowledge | — | not run |
|
| 16 |
| Multilingual | — | not run |
|
| 17 |
| Safety | — | not run |
|
|
|
|
| 30 |
- **completion**:
|
| 31 |
|
| 32 |
```text
|
| 33 |
+
Okay, so I need to solve the equation 10^x minus 10 equals 9990. Let me write that down first to make sure I have it right: 10^x - 10 = 9990. Alright, so my goal is to find the value of x that makes this equation true.
|
| 34 |
|
| 35 |
+
Hmm, let me think. I remember that 10^x is a power of ten, right? So if I can figure out what power of ten, when subtracted by 10, gives me 9990. Let me try rearranging the equati
|
| 36 |
|
| 37 |
+
... [truncated 821 chars] ...
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 38 |
|
| 39 |
+
3 and 5. But we already found that x is 4, which is exactly in the middle.
|
| 40 |
|
| 41 |
+
Wait, but since 10^x is 10,000, which is exactly 10^4, so x is 4. So even though 9990 is close to 10^4, the exact value is there.
|
| 42 |
|
| 43 |
+
So, I think my answer is correct.
|
|
|
|
|
|
|
| 44 |
|
| 45 |
+
But just to make sure, let me plug x = 4 back into the original equation.
|
|
|
|
|
|
|
| 46 |
|
| 47 |
+
Left side: 10^4 - 10.
|
| 48 |
|
| 49 |
+
10^4 is 10,000. 10,000 - 10 is 9,990. Which matches the right side of the equation.
|
| 50 |
|
| 51 |
+
Therefore, x = 4 is the correct solution.
|
| 52 |
|
| 53 |
+
I don't think I made any mistakes here. The key was recognizing that 10,000 is a power of ten, specifically 10^4, which makes the equation straightforward.
|
|
|
|
|
|
|
| 54 |
|
| 55 |
+
Alternatively, if I didn't remember the powers of ten, I could have used logarithms, but since I already confirmed it with two different methods, I think it's safe.
|
| 56 |
|
| 57 |
+
Another check: if I didn't remember 10^4 is 10,000, I could have written 10^x = 10,000. Then, since 10^1 = 10, 10^2 = 100, 10^3 = 1,000, 10^4 = 10,000. So x must be 4.
|
|
|
|
|
|
|
| 58 |
|
| 59 |
+
So yeah, that's solid.
|
| 60 |
|
| 61 |
+
I think that's all. I can't see any errors in my reasoning, and the answer checks out when I plug it back in. So I'm confident that x is 4.
|
| 62 |
|
| 63 |
+
**Final Answer**
|
| 64 |
+
The solution is \boxed{4}.
|
| 65 |
+
</think>
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 66 |
|
|
|
|
| 67 |
\boxed{4}
|
|
|
|
| 68 |
```
|
| 69 |
|
| 70 |
**Incorrect** (1 shown)
|
| 71 |
|
| 72 |
+
- **reference**: `\frac{270}7\text{ degrees}`
|
| 73 |
- **overall** (0/8 completions correct)
|
| 74 |
- **extracted** (✗): `<no answer>`
|
| 75 |
- **completion**:
|
| 76 |
|
| 77 |
```text
|
| 78 |
+
Okay, so I need to find the measure of angle BAC in this figure where a square and a regular heptagon share the side AD. Hmm, let me try to visualize this. The Asymptote code draws a regular heptagon and a square sharing side AD. The square is drawn from point A to C to D to F and back to A, and then there's a square with points labeled A, C, D, F. Wait, maybe I need to think about the positions o
|
|
|
|
|
|
|
| 79 |
|
| 80 |
... [truncated 823 chars] ...
|
| 81 |
|
| 82 |
+
ernatively, maybe it's a combination of translation and rotation.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 83 |
|
| 84 |
+
But maybe I don't need to get bogged down in the Asymptote code. Let me try to think geometrically. The square and heptagon share side AD. So, AD is a side of both. The square has four sides, so AD is one side, and the square has another side connected to D. The heptagon has AD as a side, so the heptagon has another side connected to D. The Asymptote code defines point C as A + dir(90)*(F - A), which might be constructing point C such that AC is a side of the square? Wait, if AD is a side of the square, then maybe AC is also a side? But in the Asymptote code, the square is drawn as A--C--D--F. So, if AD is a side of the square, then maybe A is connected to D? But in the square A, C, D, F, A, that would require that A is connected to D, but in the Asymptote code, A is connected to C, then C to D, D to F, F to A. So, if AD is a side of the square, then the square must be A, D, something, something. But the Asymptote code draws A connected to C, so maybe the square is A, C, D, something else?
|
| 85 |
|
| 86 |
+
Alternatively, maybe the square is A, D, F, and another point. Let me think. If AD is a side of the square, then the square has
|
| 87 |
```
|