University of Tartu | Polish Academy of Sciences
2026-05-11
multivariate machine learning (e.g. SVM) fails to map a large feature space:
| Model | Release | Parameter Count | Training Data |
|---|---|---|---|
| Opus 4.7 | 2026 | >1.6 trillion | almost the whole internet |
| GPT‑4 | 2023 | >1 trillion | web + proprietary |
| DeepSeek-R1 | 2025 | 671B | >85,000 agent tasks |
| LLaMA 2 | 2023 | 7B, 13B, 70B | public corpora |
| Mistral 7B | 2023 | 7B | public data |
| BERT | 2018 | 110M | Wikipedia + BookCorpus |
😲 recent LLMs are over 10,000 times bigger than BERT
A sentence in a phonic language:
Vs. a sentence in a sign language:
Not only SVO vs. SOV, but also the number of words differ.
(Also, sign languages use space, and have non-manual gestures…)
Transfer Learning:
Data Augmentation:
Cracoviae ex Off. Hier. Szarffenbergii. A. 1549.
Typis Univ. Zamoscensis. A. 1748.
w Łowiczu 1782.
S. Pietierburg, w tip. Wtorago Otdielenija Sobstwiennoj Jego Imp. Wieliczestwa Kancelarii, 1849,
Frankfurt und Leipzig 1728.
W drukarni Lwowskiey Soc. Jesu {b. r. 1746}.
Lemberg, 1888,
V Praze, tisk a sklad c. k. knihtiskárny Synů Bohumila Haase, 1852,
Bromberg, Louis Levit, gedruckt bei C. L. Gasse, 1844,
Dantisci 1644.
München, Druck, Franz Paul Ercacher, (ok. 1895),
1565.
Vindobonae, typ. Ueberreiter, 1840,
Lwiw, tszczanijem, iżdywenijem i typom Instytuta Stauropyhijanskaho pry Cerkwi Usp. Pr. Bohorod., 1857,
Posiedzeń 10,
Danzig, Verlag von Th. Bertling, Druck von A. W. Kafemann, 1860,
Anno M.DC.LXXXV. (1685). Crac: Typis Francisci Cezary, S. R. M. Typ.
Gedruckt zu Leiptzig, M. D. LXXVI (1576),
Dorpat, bei C. A. Kluge; Leipzig bei C. F. Köhler, gedruckt bei J. C. Schünmann in Dorpat, 1836,
Gedruckt zu Dantzigk, durch Jacobum Rhodum. M. D L XXX (1580),
Gdańsk, druk. wdowy Jerzego Rhete, 1649.
Typis Academiae Posnaniensis (1698).
In Venegia appresso Gabriel Giolito de Ferrari MDLXI (1561).PROMPT_INTRO = """You are an expert librarian, with a profound expertise in Polish prints
from 16th-19th centuries.
I will give you bibliographic entries divided into three TAB-separated fields:
Author[TAB]Title[TAB]Publication info.
Extract ONLY place of publication and year of publication.
Prioritize place/year inside parentheses if present.
Convert city names to modern Polish spelling when possible (e.g., Breslau/Vratislavia -> Wrocław;
Lemberg -> Lwów).
If missing, output "-".
OUTPUT RULES:
- Output EXACTLY one line per entry, numbered 1..N.
- Each line must be: "i. Place: <Place>, Year: <Year>"
- No extra text.
Entries:
"""Place: Mülheim a. d. R., Year: 1871-1876
Place: Warszawa, Year: 1881
Place: Warszawa, Year: 1881
Place: Toruń, Year: 1882
Place: -, Year: -
Place: Warszawa, Year: 1895
Place: -, Year: -
Place: Kraków, Year: 1892
Place: -, Year: -
Place: -, Year: -
Place: Kraków, Year: 1874
Place: Lwów, Year: 1848
Place: -, Year: 1870
Place: -, Year: -
Place: Warszawa, Year: 1831
Place: Lwów, Year: 1848
Place: Kraków, Year: 1848
Place: Lwów, Year: 1848
Place: Warszawa, Year: -
Place: -, Year: -
Place: Lwów, Year: 1848
Place: Paryż, Year: 1843
Place: Kraków, Year: 1900 The given input describes a large set of scenarios for the zombie apocalypse simulation. For each
of the 12 test cases, a valid path from the upper-left corner to the lower-right corner of the
50 × 50 grid is not found while avoiding both the obstacles and the attack ranges of the zombies.
Consequently, the output for every test case is a single line containing `-1`.
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
Place: -, Year: -
Place: -, Year: -
Place: -, Year: -
Place: -, Year: -
Place: -, Year: -#### Correctness Proof
We prove that the algorithm outputs the correct value for every query.
---
##### Lemma 1
During the processing of a query the variable `index` equals the
binary number whose bits are exactly the bits encoded by the query
(`1` → `1`, `2` → `0`), read from the first to the last integer.
**Proof.**
*Initialization.*
Before the first integer is processed `index = 0`.
This is the value of a binary number with no bits – the empty prefix.
*Induction step.*
Assume after reading the first `k` integers (`k ≥ 0`)
`index` equals the integer represented by the first `k` bits.
When the `(k+1)`‑st integer `d` is read,
the algorithm shifts the current value left by one (`index << 1`)
and OR‑s with the new bit `bit` (`0` if `d = 2`, `1` if `d = 1`).
Thus the new value represents the binary number whose prefix
consists of the first `k` bits followed by the `(k+1)`‑st bit.PROMPT_INTRO = """You are an expert librarian, with a profound expertise in Polish prints
from 16th-19th centuries.
I will give you bibliographic entries divided into three TAB-separated fields:
Author[TAB]Title[TAB]Publication info.
Extract ONLY place of publication and year of publication.
Prioritize place/year inside parentheses if present.
Convert city names to modern Polish spelling when possible (e.g., Breslau/Vratislavia -> Wrocław;
Lemberg -> Lwów).
If missing, output "-".
Take the entries one by one carefully to avoid confusion.
Expect to process exactly 50 entries.
OUTPUT RULES:
- Output EXACTLY one line per entry, numbered 1..N.
- Each line must be: "i. Place: <Place>, Year: <Year>"
- No extra text.
Entries:
"""| Place | Year | laptop | local | cloud | ||
|---|---|---|---|---|---|---|
| gpt-oss:20b | 0.890 | 0.856 | ✅ | ✅ | ✅ | |
| gemma4:26b | 0.840 | 0.854 | ✅ | ✅ | ❌ | |
| qwen3.6:35b | 0.940 | 0.959 | 🏆 | 🐌 | ✅ | ❌ |
| gemma4:31b | 0.929 | 0.951 | 👀 | 🐌🐌 | 🐌 | ✅ |
| qwen3.6:27b | 0.945 | 0.953 | 💪 | 🐌🐌 | 🐌 | ❌ |
| deepseek:70b | 0.646 | 0.422 | ❌ | ✅ | ✅ | |
| gpt-oss:120b | 0.924 | 0.713 | ❌ | ✅ | ✅ | |
| gpt5.4 | ??? | ??? | 🥇 | ❌ | ❌ | ✅ |
gemma3n – multilingual, designed to work on older laptopsdeepseek-r1:8b – reasoning model, yet still relatively smallqwen3.5:9b – a new kid on the block, reasoning while compactmistral-small – bulky (13Gb on disk), but still can be run locallygpt-oss:20b – might require a recent laptop, but still installablecogito:70b – a monster desktop computer should be able to handle it