3 ms·

Hn upvotes the weirdest things. You're talking about polyhedral analysis which emphatically does not work on diophantine forms http://polyhedral.info/ http://p

Hn upvotes the weirdest things. You're talking about polyhedral analysis which emphatically does not work on diophantine forms http://polyhedral.info/ http://polyhedral.info/

jjtheblunt 3mo ago
Check the link above...it seems we're considering different topics. 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.
srean 3mo ago
What's with this phenomenon of new accounts that confidently make authoritative false claims in things that they have no competence in. 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.
- mathisfun123 3mo ago
  > March 9, 2023 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 :)
  - srean 3mo ago
    That was my guess anyhow. A common affliction among newly minted PhDs. They usually out grow it. I am reminded of https://news.ycombinator.com/user?id=almostgotcaught 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.
    - deleted 3mo ago
      [deleted]
  - jjtheblunt 3mo ago
    Is your thesis published and at a URL? Since I'm an old parallelizing compilers person, I'm curious what you did. (genuinely curious, not obnoxiously curious). You should know a serious fraction of folks commenting on these threads have resumes like you're bragging about.
    - mathisfun123 3mo ago
      > Is your thesis published and at a URL 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 PhDs in tech, but because generally the comments on hn are from outsider wannabes
      - jjtheblunt 3mo ago
        definitely increasingly over the last years from outsider folks, agreed. lots of obnoxious sniping nonsense over the last few years too. anyway, fun stuff for folks like us otherwise still

Hn upvotes the weirdest things. You're talking about polyhedral analysis which emphatically does not work on diophantine forms http://polyhedral.info/ http://polyhedral.info/

jjtheblunt 3mo ago

Check the link above...it seems we're considering different topics. 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.

srean 3mo ago

What's with this phenomenon of new accounts that confidently make authoritative false claims in things that they have no competence in. 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.

mathisfun123 3mo ago
> March 9, 2023 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 :)
- srean 3mo ago
  That was my guess anyhow. A common affliction among newly minted PhDs. They usually out grow it. I am reminded of https://news.ycombinator.com/user?id=almostgotcaught 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.
  - deleted 3mo ago
    [deleted]
- jjtheblunt 3mo ago
  Is your thesis published and at a URL? Since I'm an old parallelizing compilers person, I'm curious what you did. (genuinely curious, not obnoxiously curious). You should know a serious fraction of folks commenting on these threads have resumes like you're bragging about.
  - mathisfun123 3mo ago
    > Is your thesis published and at a URL 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 PhDs in tech, but because generally the comments on hn are from outsider wannabes
    - jjtheblunt 3mo ago
      definitely increasingly over the last years from outsider folks, agreed. lots of obnoxious sniping nonsense over the last few years too. anyway, fun stuff for folks like us otherwise still