Most often these analyses were framed in terms of integer indices on multidimensional arrays in Fortran loops, though that was just the common format academics all knew, as i recall. Personally I'd started with C (and x86 assembly and Basic on Apple ][ and Atari 800) so was a younger vintage.
Few days ago there was this account claiming there's no rotation matrices to be seen in any ML algorithms.
EDIT: oh it's the same guy. LoL.
This is a new account?
> no competence in.
I have a PhD in ML compilers (one of my papers is cited on the site I linked) and as I mentioned in the previous "discussion" I currently work in FAANG as an ML compiler engineer.
But thanks for playing :)
I am reminded of https://news.ycombinator.com/user?id=almostgotcaught
Won't be surprised if it's the same person.
FAANG are now in the midst of a hype cycle. So that place of employment signal is pretty noisy now, especially if employed in the hyped field.
Coming back to the point, Polyhedral models for loop analysis and Diophantine equation based address aliasing analysis are quite different techniques.
You should know a serious fraction of folks commenting on these threads have resumes like you're bragging about.
yes but i'm not going to link it here in order to preserve my anonymity
> You should know a serious fraction of folks commenting on these threads
<X to doubt> not because i'm not aware there aren't lots of people with PhD in tech, but because generally the comments on hn are from outsider wannabes
anyway, fun stuff for folks like us otherwise still
http://polyhedral.info/