<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Phi-4 Technical Report · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2412.08905/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2412.08905/feed.xml" rel="self" type="application/rss+xml" /><item><title>Phi-4 Technical Report — mentioned by jmorgan</title><link>https://news.ycombinator.com/item?id=42671237</link><guid isPermaLink="false">urn:hackerpapers:mention:2412.08905:42671237</guid><pubDate>Sun, 12 Jan 2025 04:16:20 GMT</pubDate><description>&lt;p&gt;Phi-4&amp;#x27;s architecture changed slightly from Phi-3.5 (it no longer uses a sliding window of 2,048 tokens [1]), causing a change in the hyperparameters (and ultimately an error at inference time for some published GGUF files on Hugging Face, since the same architecture name/identifier was re-used between the two models). For the Phi-4 uploaded to Ollama, the hyperparameters were set to avoid the error. The error should stop occurring in the next version of Ollama [2] for imported GGUF files as well In retrospect, a new architecture name should probably have been used entirely, instead of…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2412.08905/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Phi-4 Technical Report — mentioned by osaariki</title><link>https://news.ycombinator.com/item?id=42578307</link><guid isPermaLink="false">urn:hackerpapers:mention:2412.08905:42578307</guid><pubDate>Thu, 02 Jan 2025 20:12:18 GMT</pubDate><description>&lt;p&gt;For some interesting context: this paper was a precursor to all the work on synthetic data at Microsoft Research that lead to the Phi series of SLMs. [1] It was an important demonstration of what carefully curated and clean data could do for language models. 1: https://arxiv.org/abs/2412.08905&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2412.08905/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Phi-4 Technical Report — HN submission</title><link>https://news.ycombinator.com/item?id=42508407</link><guid isPermaLink="false">urn:hackerpapers:submission:2412.08905:42508407</guid><pubDate>Wed, 25 Dec 2024 12:07:19 GMT</pubDate><description>&lt;p&gt;Phi-4 Technical Report&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2412.08905/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Phi-4 Technical Report — mentioned by zurfer</title><link>https://news.ycombinator.com/item?id=42429346</link><guid isPermaLink="false">urn:hackerpapers:mention:2412.08905:42429346</guid><pubDate>Mon, 16 Dec 2024 09:16:16 GMT</pubDate><description>&lt;p&gt;Model releases without comprehensive coverage of benchmarks make me deeply skeptical. The worst was the gpt4o update in November. Basically a 2 liner on what it is better at and in reality it regressed in multiple benchmarks. Here we just get MMLU, which is widely known to be saturated and knowing they trained on synthetic data, we have no idea how much &amp;quot;weight&amp;quot; was given to having MMLU like training data. Benchmarks are not perfect, but they give me context to build upon. --- edit: the benchmarks are covered in the paper: https://arxiv.org/pdf/2412.08905&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2412.08905/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Phi-4 Technical Report — mentioned by simonw</title><link>https://news.ycombinator.com/item?id=42426729</link><guid isPermaLink="false">urn:hackerpapers:mention:2412.08905:42426729</guid><pubDate>Sun, 15 Dec 2024 23:32:22 GMT</pubDate><description>&lt;p&gt;The most interesting thing about this is the way it was trained using synthetic data, which is described in quite a bit of detail in the technical report: https://arxiv.org/abs/2412.08905 Microsoft haven&amp;#x27;t officially released the weights yet but there are unofficial GGUFs up on Hugging Face already. I tried this one: https://huggingface.co/matteogeniaccio/phi-4/tree/main I got it working with my LLM tool like this: llm install llm-gguf llm gguf download-model https://huggingface.co/matteogeniaccio/phi-4/resolve/main/phi-4-Q4_K_M.gguf llm chat -m gguf/phi-4-Q4_K_M Here are some initial…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2412.08905/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Phi-4 Technical Report — mentioned by m_ke</title><link>https://news.ycombinator.com/item?id=42425059</link><guid isPermaLink="false">urn:hackerpapers:mention:2412.08905:42425059</guid><pubDate>Sun, 15 Dec 2024 18:34:53 GMT</pubDate><description>&lt;p&gt;There&amp;#x27;s a ton of recent work on data curation / synthetic data generation that shows that smaller high quality datasets go a lot further than scaling up on noisy web data. The scaling law plots are log scale so to get more juice with naive scaling we&amp;#x27;d need to invest exponentially more resources, and we&amp;#x27;re at a point where the juice is not worth the squeeze, so people will shift to moving the curve down with new architectures, better curated datasets and test time compute / RL. See: - FineWeb: https://arxiv.org/abs/2406.17557 - Phi-4: https://arxiv.org/abs/2412.08905 - DataComp…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2412.08905/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Phi-4 Technical Report — HN submission</title><link>https://news.ycombinator.com/item?id=42414095</link><guid isPermaLink="false">urn:hackerpapers:submission:2412.08905:42414095</guid><pubDate>Sat, 14 Dec 2024 02:12:02 GMT</pubDate><description>&lt;p&gt;Phi-4 Technical Report&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2412.08905/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Phi-4 Technical Report — HN submission</title><link>https://news.ycombinator.com/item?id=42408493</link><guid isPermaLink="false">urn:hackerpapers:submission:2412.08905:42408493</guid><pubDate>Fri, 13 Dec 2024 14:04:47 GMT</pubDate><description>&lt;p&gt;Phi-4 Technical Report&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2412.08905/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Phi-4 Technical Report — mentioned by lappa</title><link>https://news.ycombinator.com/item?id=42406078</link><guid isPermaLink="false">urn:hackerpapers:mention:2412.08905:42406078</guid><pubDate>Fri, 13 Dec 2024 05:10:17 GMT</pubDate><description>&lt;p&gt;It&amp;#x27;s easy to argue that Llama-3.3 8B performs better than GPT-3.5. Compare their benchmarks, and try the two side-by-side. Phi-4 is yet another step towards a small, open, GPT-4 level model. I think we&amp;#x27;re getting quite close. Check the benchmarks comparing to GPT-4o on the first page of their technical report if you haven&amp;#x27;t already https://arxiv.org/pdf/2412.08905&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2412.08905/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
