mzl

6 ms·

31.
by mzl 9mo ago
I don't think it would be economically viable to serve the full DeepSeek models on Cerebras hardware.
32.
by mzl 9mo ago
Asking someone to give a sharp dividing line in a multi-dimensional bimodal but not discontinuous distribution is just nonsense. In particular, being unable to give that strict difference (that does not exist) is not proof of not believing
33.
by mzl 10mo ago
A better reason why wine glasses are not filled like that is that wine glasses are designed to capture the aroma of the wine. Since people look at a glass of wine and judge how much "value" they got based partly on how much wine i
34.
by mzl 10mo ago
You might not have a school education, but you have educated yourself. It is unfortunately common to hear people complain that the theory one learns in school (or by determined self-study) is useless, which I think is what the geybeard comm
35.
by mzl 11mo ago
Fun article. The Rush Hour puzzle is quite fun when viewed as a planning problem. In standard PDDL the model becomes very messy. I like the extensions proposed in https://arxiv.org/abs/2412.06312v1 that makes the mode
36.
by mzl 11mo ago
While it is possible to self-host small models, it is not easy to host them with high speeds. Many small-model use-cases are for large batches of work (processing large amounts of documents, agentic workflows, ...), and then using a provide
37.
A Technical Tour of the DeepSeek Models from V3 to v3.2(magazine.sebastianraschka.com)
5 points by mzl 11mo ago|1 comments
38.
by mzl 11mo ago
Yep, I agree on that. But still, interesting to see that such a "standard" thing can be so different in different dialects of mathematical notation.
39.
by mzl 11mo ago
I wrote about overlapping intervals a while ago, and used what I thought was the standard math notation for closed and half-open intervals. From comments, I learned that half-open intervals are written differently in french mathematics: ht
40.
by mzl 11mo ago
Anything in particular?
41.
by mzl 11mo ago
Sometimes, that can be the case, but sometimes it takes a surprising amount of insight to make something that is useful. It is often easy to look at a final model and think that it is obvious. For this problem, there are really three key in
42.
Discovering Underlying Analytic Structure in Standard Model Constants Using AI(mdpi.com)
1 points by mzl 11mo ago|0 comments
43.
Intelligence per Watt: Measuring Intelligence Efficiency of Local AI(arxiv.org)
3 points by mzl 11mo ago|0 comments
44.
by mzl 11mo ago
Apart from measuring prices from venture-backed providers which might or might not correlate with cost-effectiveness, I think the measures of intelligence per watt and intelligence per joule from https://arxiv.org/abs/2
45.
DeepSeek-v3.2: Pushing the Frontier of Open Large Language Models(cas-bridge.xethub.hf.co)
3 points by mzl 11mo ago|0 comments
46.
by mzl 11mo ago
Previous submission: https://news.ycombinator.com/item?id=46057932
47.
Solving the Partridge Packing Problem Using MiniZinc(zayenz.se)
33 points by mzl 11mo ago|4 comments
48.
by mzl 11mo ago
> The classic "fish don't know what water is": what Americans can't see, because they were raised from birth and marinating in it, foreigners can spot more readily by contrast. Learning that US schoolchildren recite t
49.
by mzl 11mo ago
According to MDN it is expected to be an actual comparator: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Refe... The specification says that if the comparator is not a consistent comparator, t
50.
by mzl 11mo ago
While Fisher-Yates or similar algorithms are more efficient, the real reason I wanted to mention it is that in many systems the sorting algorithm might crash or corrupt memory when used with a randomized comparison operator. It is inherentl
51.
by mzl 11mo ago
Btw, note that the line const randomNumbers = random ? [1, 2, 3, 4, 5, 6, 7, 8, 9].sort(() => Math.random() - 0.5).sort(() => Math.random() - 0.5) : null does not really do what you seem to intend. Sort requires a comparison
52.
by mzl 11mo ago
You will most likely need both smarter heuristics and better deductions for larger instances. As mentioned, I've seen well-engineered custom tight C++-solvers with decent heuristics and the normal deductions take >1 hour on some ins
53.
by mzl 11mo ago
That is an interesting post. However, a much more interesting challenge is solving larger Sudoku puzzles, as 9x9 is (as evidenced in the pos) a trivial problem to solve. 16x16 starts to get somewhat interesting, but at 25x25 it gets really
54.
by mzl 1y ago
Is there any property in particular of dancing links that you think helps in determining this, or is it just that a backtracking search can be used to test all cases? For pen-and-paper puzzles like Sudoku there is usually the goal that a so
55.
by mzl 1y ago
Dancing links is a very cute data-structure for a backtracking search, but there are a lot more aspects of writing a good Sudoku solver than just having a good data-structure for backtracking. Propagation (making deductions), heuristics, le
56.
by mzl 1y ago
That representation of a Sudoku is elegant, but I think it is not the most natural representation. The base constraint programming style will use a variable per square with domain 1-9, and then 27 all_different constraints. This representat
57.
by mzl 1y ago
My process is generally that I want to prototype the model in MiniZinc and use that to run benchmarks. If the problem to solve is large or batch-oriented, I might also use MiniZinc in production (probably via the python wrapper for the tool
58.
by mzl 1y ago
That is more the area of workforce management systems, and they are really big business. I’ve previously tried starting a scheduling company, and even when one has a product that in testing shows that it would save the potential customers l
59.
Rotating Workforce Scheduling in MiniZinc(zayenz.se)
56 points by mzl 1y ago|7 comments
60.
by mzl 1y ago
Chuffed has very low overhead while still being a very fast LCG solver, so it is not surprising that it works best for small problems. You might find it interesting to install and try both Huub ( https://github.com/huub-solve

More ›