bmc7505

6 ms·

31.
by bmc7505 2y ago
The trick is not just synthesizing valid functions, but doing so in a parallel communication-free manner, without compromising soundness or completeness. You want to massively scale up a discrete sampler without replacement. One very effici
32.
by bmc7505 2y ago
Maciej Bendkowski has some related work [1] on generating random lambda terms, but was unable to overcome what he calls the asymptotic sparsity problem: Sampling simply-typed terms seems notoriously more challenging than sampling closed
33.
by bmc7505 2y ago
This is a very nice approach. Unfortunately, Piantadosi's pairing function does not work for acyclic grammars (i.e., finite CFLs). We found a variant that handles enumerating all trees of a certain width from an arbitrary CFG, i.e., L(
34.
by bmc7505 2y ago
It's coming! CMUSphinx used to have something like this, and there are some [1] solutions [2] on the horizon. [1]: https://github.com/alphacep/vosk-api/issues/55 [2]: https://github.com/o
35.
by bmc7505 2y ago
> All AI is written with Python. Type error on line 3: “Python” is not a valid type for “all AI”.
36.
by bmc7505 2y ago
A more charitable view is that a lot of research projects which seem like chmess to an outside observer become a lot more rational when properly contextualized. Often, the authors have justifications, ontological commitments or motivational
37.
by bmc7505 3y ago
Old enough to remember the days when Java reached near AI-level hype. Most of the advanced placement and undergraduate CS courses in the U.S. were taught in Java. There was an annual conference in San Fransisco called JavaOne/Oracle Op
38.
by bmc7505 3y ago
I assure you, the open source community around modern IDEs is thriving. I see plenty of innovation in plugin marketplaces that is hard to find in even the Emacs/Vim ecosystem. Despite its share of detractors, there is a lot of value in
39.
by bmc7505 3y ago
The best part is, you don't need to choose between using IDEs and your favorite text editor! Most modern IDEs with proper plugin support can be configured to provide a superset of Vim's functionality. I personally use IdeaVim on t
40.
by bmc7505 3y ago
Hi, author here. Would you mind sharing which browser and version you are using? Thanks.
41.
Show HN: Tidyparse: Real-time syntax error correction for context-free languages(tidyparse.github.io)
2 points by bmc7505 3y ago|2 comments
42.
by bmc7505 3y ago
https://en.wikipedia.org/wiki/Revenge_buying
43.
by bmc7505 3y ago
I guess I was thinking more of multithreading as an umbrella term for parallelism but I see your point. If you squint, SIMD and multithreading are the same problem. What I mean is, if you have a computable function you want to evaluate on a
44.
by bmc7505 3y ago
Well, yes. But assuming the question is how to reduce overall latency, what alternative is there besides algorithmic improvements or increasing clock frequency?
45.
by bmc7505 3y ago
I mean why isn’t multithreading the answer?
46.
by bmc7505 3y ago
Care to elaborate?
47.
by bmc7505 3y ago
Curves need not be smooth, for example we may consider elliptic curves over finite fields [1] or space-filling curves [2]. In general, there are various ways to generalize the notion of curvature to discrete structures like graphs and progr
48.
by bmc7505 3y ago
How would you access the source code of an encrypted program after copyright expiration if the author is dead and gives no one the keys? You might be thinking of public domain?
49.
by bmc7505 3y ago
Nope. I support open source and personally release all my work in the open, but also support authors' freedom to distribute their own work however they wish and users' freedom to choose between them. These are fully consistent vie
50.
by bmc7505 3y ago
I am a firm believer in open source, with the caveat that authors should always and everywhere have ultimate say over how to release their own work, never legislators or courts. FOSS may be the morally and technically preferable choice for
51.
by bmc7505 3y ago
https://en.wikipedia.org/wiki/Cybernetics_in_the_Soviet_Unio...
52.
by bmc7505 3y ago
They would be foolish not to at least try, either by intercepting entropy-supplying syscalls or compromising the hardware directly. RNG attacks are easy to design and nearly impossible to detect. https://en.wikipedia.org/wik
53.
by bmc7505 3y ago
You also need some kind of beam search or rejection sampling since JSON tokens to not exactly correspond to logits. edit: They describe this more carefully in the paper.
54.
by bmc7505 3y ago
Not sure why you are getting downvoted, as I believe there is a kernel of truth to what you are saying. Although I am sympathetic to the idealist position, based on what we know today about computers, I have come to believe that the thing s
55.
by bmc7505 3y ago
Another related thread from last month: https://news.ycombinator.com/item?id=36084461
56.
Efficient and Portable Einstein Summation in SQL(dl.acm.org)
1 points by bmc7505 3y ago|0 comments
57.
by bmc7505 3y ago
The current generation of LLMs will never generalize on problems whose expected complexity is significantly harder than the training set. One way to think of why this is the case is because transformers are learning shortcuts to multistep r
58.
by bmc7505 3y ago
This is what happens when your objective function is to generate plausible or well-aligned next-word predictions - the model will converge on agreeable nonsense that sounds credible but is increasingly divorced from the truth. RLHF is a lou
59.
by bmc7505 3y ago
I was skeptical, but it turns out you're right! According to Wikipedia, the Northernmost point in California is 42 degrees north, and the Southernmost point in Canada is Middle Island, which is 41.7 degrees north [1], or about 0.3 degr
60.
by bmc7505 3y ago
It can be done for fixed-length lists. Optimal sorting networks [1] are an active research topic with many interesting connections to differentiable sorting and ranking [2]. [1]: https://en.wikipedia.org/wiki/Sorting_ne

More ›