TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Loop Perforation (2019)

16 pointsby Jonhooover 3 years ago

3 comments

touisteurover 3 years ago
I think this is a <i>very</i> elaborate joke, though I was always surprised by some linear algebra algorithms that had a &#x27;cooking recipe&#x27; feeling (looking at you svd) of &#x27;loop enough time to get better results&#x27;...
seg_lolover 3 years ago
When your operations are statistical in nature, as Approximate Computing is, so then these operations themselves are different sampling methods.<p>If the for loop is calculating a sum, but that value only needs to be over a threshold, there is no reason to add the whole thing, you need a proper sample size and distribution and that it what Loop Perforation is giving you in this case.
dreamcompilerover 3 years ago
The way you add the integers up to n is<p>n(n+1)&#x2F;2.<p>Fixed that for you. No loops, and it&#x27;s exact. Pick a better example.