silentvoice

11 ms·

1.
by silentvoice 4mo ago
Almost no part of the algorithm as specified in the blog post is GPU friendly, but it can be improved. The "symbolic" phase is very hard to port to the GPU in the first place and almost always happens on the CPU side. But even the
2.
by silentvoice 5mo ago
what are some bad behaviors you've seen with NFS,ZFS,RAID and how do you diagnose it and how did it lead you to this solution
3.
by silentvoice 7mo ago
I have no submission for this but I joined the hype in my own way by optimizing the training loop. These tiny models are not really well suited to frameworks like pytorch, and with highly patient AI agents we can now just inline the whole t
4.
by silentvoice 11mo ago
oh boy I've got opinions here. Basically I just don't want to hear about "the state of SIMD in Rust" unless it is about dramatic improvement in autovectorization in the rust compiler. 80%-90% or so of real life vectoriza
5.
by silentvoice 1y ago
There are two sides to numerical linear algebra. The first is the "linear algebra" part, which is very mathematically sophisticated and the language you choose to represent these concepts is not so important as your understanding.
6.
by silentvoice 7y ago
Thanks! The chunks trick was a fairly straightforward translation of what I would do in C++ if the compiler wouldn't vectorize the reduction for some reason. These days most compilers will do it if you pass enough flags, a fact I reall
7.
by silentvoice 7y ago
Hi I wrote the blog post linked - and I feel a little silly that I didn't check that _both_ loops vectorized. So I fixed the Rust implementation to keep a running vector of partial sums which I finish up at the end - this one did vec
8.
by silentvoice 11y ago
I wasn't clear enough. I was responding to the flow of comments of the form: "Riemann hypothesis is hard, this is unlikely to be true." Sure it's true, but doing a little more research could inform that opinion well past
9.
by silentvoice 11y ago
Coming from a PhD in math I can give this good trick for assessing grand mathematical claims: Google the authors. Maybe unfair to intelligent amateurs, but based on my decade of experience you find out from this whether to take something se
10.
by silentvoice 11y ago
Maybe a better term should be "blind" rather than black-box. I think the goal is simply to hold optimization to the same level of reproducibility that is expected of most scientific fields today, and if a researcher is allowed to
11.
Black box optimization competition(bbcomp.ini.rub.de)
32 points by silentvoice 11y ago|25 comments
12.
by silentvoice 12y ago
How is this for "performance portability?" I use this solution in C when the function is very expensive, therefore a little extra indirection really won't make any difference - but can potentially improve the reusability a lo
13.
by silentvoice 12y ago
Curious it doesn't mention C11's __Generic macro. A very nice way to achieve a lot of useful "overloading" behavior. http://en.wikipedia.org/wiki/C11_%28C_standard_revision%29
14.
by silentvoice 12y ago
The idea of using DSLs in this field is attractive. The amount of math you have to hold in your head to really start talking about large scale simulations is staggering, and it gets more and more complicated as you scale up. There are thous
15.
by silentvoice 12y ago
Very handy formula. I was recently in the situation of being given a bunch of polygons, each represented in a list-of-edges format and I needed to compute the outward-pointing normals for the edges. It's relatively straightforward to t
16.
by silentvoice 12y ago
Symbolic math is not the same thing as formalized math, and doesn't carry with it the same guarantees of correctness. That's the price one pays for having black box functions spit out answers to hard problems in a reasonable time,
17.
by silentvoice 12y ago
Could someone comment on the following C++14 feature on the list here: "Avoiding/fusing memory allocations" It lists Clang but nothing else as supporting it. This sounds like a compiler optimization and not a language feature
18.
by silentvoice 12y ago
The lack of price transparency and emergence of 3rd party system was direct result of heavy regulations on health care dating back to WW2, and was slowly solidified into law through tax incentives and then recently became "official&quo
19.
Why min(NaN,x) is x in IEEE(github.com)
3 points by silentvoice 12y ago|0 comments
20.
by silentvoice 12y ago
I don't know how useful it will be in the end. The idea of targeting a powerful (proper) subset of turing completeness to produce fast executables makes a lot of sense to me, and furthermore for reasons that you have already brought up
21.
by silentvoice 12y ago
It's a little bit of a misrepresentation on the part of the presenter. BLAS is a specification for linear algebra software, of which implementers are free to use the most appropriate representation of numbers as they wish - the faste
22.
by silentvoice 12y ago
Did the author claim Morte was Turing-complete? I don't think I saw that claim, but I'm a newcomer to all this computer science theory stuff. I think these Wikipedia links answer your question: http://en.wikipedia.org&#
23.
by silentvoice 12y ago
Is this a proper excuse for me to enjoy the sun more every day?
24.
by silentvoice 12y ago
Did I read this right? The thesis was: Psychopathy may be correlated with higher IQ. Tests were done, except the psychopathic responses were recorded on the lower IQ responders, not high IQ responders. Conclusion: High IQ psychopaths faked
25.
by silentvoice 12y ago
Matrix multiplication is one of the most abused computational kernels when showing off cache locality and vectorization optimizing compilers. Unfortunately very few scientific codes consist of massive matrix-matrix multiplies, and even more
26.
by silentvoice 12y ago
I like the standard "epsilon/delta" approach better. In that approach the idea of "infinite" insofar as it applies to real numbers is introduced solely as a notational convenience, and is in no way necessary. All no
27.
by silentvoice 12y ago
At least in my field, doing a PhD in the U.S. was essentially the same as what the author described for their country. Freedom of topic choice comes with independent funding, otherwise your advisor will be telling you what is consistent wit
28.
by silentvoice 12y ago
Like I said above, induction can be used to prove facts which are not equations. In fact most equations are best proved without induction, at least in my opinion. I was getting this argument even when the fact to be proved was not an equati
29.
by silentvoice 12y ago
If the fact to be proved is an equation, then this could be conceivably a reasonable approach - assuming it is correctly written. Our class was a math class, so we weren't just giving them equations that hold for natural numbers (which
30.
by silentvoice 12y ago
This is really confusing to me. Let's take their definition of a free object: "A free object over a set forgets everything about that set except some universal properties, specified by the word following free. For example, the fr

More ›