Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
osmarks
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
5 ms
·
1.
▲
by
osmarks
1y ago
I was briefly looking into using SMT for Minecraft autocrafting, but it turns out you can do integer linear programming and the mapping is easier.
2.
▲
by
osmarks
1y ago
This is sort of true currently, but extrapolate the trend.
3.
▲
by
osmarks
1y ago
Also, I don't use ChatGPT to rewrite blog posts and don't like people who do. Its style is annoying and if ChatGPT is doing content I might as well ask it whatever you asked it myself directly. For code I do not care much so lon
4.
▲
by
osmarks
1y ago
Artists correctly realized the threat to their future economic viability and made up reasons it was morally bad. Programmers are currently stuck in an earlier stage, insistent that it can never replace them because [various things].
5.
▲
by
osmarks
1y ago
https://arxiv.org/abs/2212.10496
6.
▲
by
osmarks
1y ago
Common Crawl is petabytes. Anna's Archive is about a petabyte, but it includes PDFs with images.
7.
▲
by
osmarks
1y ago
You could just run a local LLM over every document and ask it "is this related to this query". I don't think you actually want to wait a week (and holding all the documents you might ever want to search would run to petabytes
8.
▲
by
osmarks
2y ago
There is at least one organization doing actual embedding-based search (Exa). I wrote about this a bit: https://docs.osmarks.net/hypha/osmarks.net_web_search_plan_%... .
9.
▲
by
osmarks
2y ago
Most of these are just an EPYC server platform, some cursed risers and multiple PSUs (though cryptominer server PSU adapters are probably better). See https://nonint.com/2022/05/30/my-deep-learning-rig/
10.
▲
by
osmarks
2y ago
They couldn't have built it on anything but UDP because the world is now filled with poorly designed firewall/NAT middleboxes which will not route things other than TCP, UDP and optimistically ICMP.
11.
▲
by
osmarks
2y ago
The C specification limits programs to addressing a finite amount of memory, though it can be made arbitrarily large by an implementation. The Python specifications do not imply this though real interpreters do.
12.
▲
by
osmarks
2y ago
Yes. C is not Turing-complete even in theory. Other languages are. It doesn't especially matter.
13.
▲
by
osmarks
2y ago
You can't implement a Python interpreter with access to infinite memory in C as specified. That is the point.
14.
▲
by
osmarks
2y ago
CommonMark mostly fixes this.
15.
▲
by
osmarks
2y ago
Preserving the semantic content is helpful if you think you might want to switch the rendering later.
16.
▲
by
osmarks
2y ago
I solve this for my usecases with custom Markdown rendering which accepts a few new block elements (via a markdown-it plugin). https://github.com/osmarks/website/blob/master/src/index.js
17.
▲
by
osmarks
2y ago
Python-the-language can be Turing-complete even if Python-as-actually-implemented is not.
18.
▲
by
osmarks
2y ago
C is indeed not Turing-complete for more or less this reason.
19.
▲
by
osmarks
2y ago
Crowdstrike should have higher testing standards, not every random back-office process.
20.
▲
by
osmarks
2y ago
> When I first read about Darwin Machines, I looked up "evolutionary algorithms in AI", thought to myself "Oh hell ya, these CS folks are on it" and then was shocked to learn that "evolutionary algorithms" s
21.
▲
by
osmarks
2y ago
> A Darwin Machine uses evolution to produce intelligence. It relies on the same insight that produced biology: That evolution is the best algorithm for predicting valid "solutions" within a near infinite problem space. It seem
22.
▲
by
osmarks
2y ago
I don't think this is true as stated. Evolutionary algorithms are not the most efficient way to do most things because they, handwavily, search randomly in all directions. Gradient descent and other gradient-based optimizers are way wa
23.
▲
by
osmarks
2y ago
Mistral and Meta release "instruct" (RLHF) and not-instruct models. The non-instruct ones are in fact non-RLHF, pretraining-only ones (though they probably have ChatGPT-ish text in the dataset nowadays, and Meta might have done so
24.
▲
Counterintuitive Probabilities: Typical Sets from Information Theory
(web.archive.org)
2 points
by
osmarks
2y ago
|
0 comments
25.
▲
by
osmarks
2y ago
The Google research was based on OpenAI research from 2021, though.
26.
▲
by
osmarks
2y ago
( https://arxiv.org/pdf/2209.06794.pdf page 20.)
27.
▲
by
osmarks
2y ago
I think the SigLIP models' dataset (WebLi) includes OCRed things too, so they have very good text understanding. I tested a bunch of things for my own meme search engine.
28.
▲
by
osmarks
3y ago
People are perfectly happy to give other people specific gifts, which are even more constraining than gift cards. This doesn't seem that surprising.
29.
▲
by
osmarks
3y ago
AX201s have always worked perfectly for me.
30.
▲
by
osmarks
3y ago
https://github.com/facebookresearch/faiss/wiki/Vector-codecs has some good things available too.
More ›