News for hackers. Stuff that matters.
Re:Ask HN: What was the best CS paper you read in 2017? by sulam on Saturday December 30, 2017 @10:50AM (#16035723)
I highly recommend people give this paper a read. I think it points the way to a radical redesign of fundamental parts of the system stack over the next 5-10 years. If you work in systems and you aren’t thinking about this stuff, you’re about to be lapped.

The Case for Learned Index Structures:

https://arxiv.org/pdf/1712.01208v1.pdf

Re:Ask HN: What was the best CS paper you read in 2017? by chubot on Saturday December 30, 2017 @12:13PM (#16036133)
I'm gonna throw some cold water on this and say this is not a new paradigm by any means.

https://www.sigarch.org/the-unreasonable-ineffectiveness-of-...

However, it's certainly possible that the time for this idea has come. Google is probably in the best position to apply it.

I will say that after having worked at Google for over a decade, some of it on data center performance, there are plenty of inefficiencies that have nothing to do with algorithms or code, but have more to do with very coarse-grained resource allocation. In other words, they are "boring management problems" rather than sexy CS problems.

I should also add that you're expanding the claims made in the paper, which appears to be a common mistake. If you look at the related work and citations, you'll see that it's mostly about B-Trees, bloom filters, and indices. But I have seen people generalizing this to "a revolution in systems research", which I don't believe is justified.

Indexed data structures are important but a revolution in them is not going to cause a revolution in all of systems. Off the top of my head, the general area of "scheduling" (in time and space) is probably more important and more potentially impactful.

Re:Ask HN: What was the best CS paper you read in 2017? by sulam on Saturday December 30, 2017 @12:49PM (#16036324)
Have you seen the results when they let a trained model manage Borg? The power reductions were immediate, non-trivial, and performance stayed the same. There's your scheduling result for you.

Look at it this way. As the paper points out, a Hashtable is just a heuristic that works fairly well in the worst case and reasonably well in the average case. No one would argue that you couldn't hand-roll an algorithm that is better for a specific, narrowly defined data set. This paper is demonstrating that you don't have to do it by hand, you can train a model automatically without the expected caveats like: size (doesn't have to be huge), latency (the model trains very quickly) or specialized hardware (they used bog-standard CPUs, not GPUs or TPUs).

This is obviously just my opinion, but I think it's pretty big. It's not big because of the paper itself, although that's amazing in isolation (they improved on hashtables!). As I said above, it _points the way_. They have a throw-away sentence about co-optimizing data layout along with lookup and not showing those result. My guess is that beats a hashtable in every way. More importantly, if a model can beat bloom filters, b-trees, and hashtables, you'd better hold onto your socks because most algorithms are just waiting to fall. To me this paper is Deep Blue vs Kasparov. We all know what comes next.

Re:Ask HN: What was the best CS paper you read in 2017? by chubot on Sunday December 31, 2017 @02:15AM (#16039746)
It sounds like a useful technique, but I'm saying that what you're claiming is a far cry from what the paper claims. They're describing a fruitful research direction and outlining how you might get around certain problems (evaluating models is slow, retraining on inserts, etc.)

Also, predicting power usage is a different problem than scheduling. It's not "managing Borg" by any stretch of the imagination. I'm not saying that's impossible, but it's not what was claimed.

Also, what did Deep Blue lead to? I'm not saying it wasn't impressive, but it didn't generalize AFAIK. You are making a huge leap and claiming that a technique that isn't even deployed generalizes.

What did Watson lead to?

https://www.technologyreview.com/s/607965/a-reality-check-fo...

https://respectfulinsolence.com/2017/09/18/ibm-watson-not-li...

https://www.statnews.com/2017/09/05/watson-ibm-cancer/

Re:Ask HN: What was the best CS paper you read in 2017? by cinjon on Saturday December 30, 2017 @04:58PM (#16037854)
Link to paper that cedes control of Borg?
Re:Ask HN: What was the best CS paper you read in 2017? by sulam on Saturday December 30, 2017 @05:59PM (#16038210)
Re:Ask HN: What was the best CS paper you read in 2017? by tweenagedream on Saturday December 30, 2017 @08:42PM (#16038835)
Slight correction, they let an ml algorithm control the cooling system in the data center, not Borg. Borg is what schedules Google's software tasks, this was not changed during this experiment.
Re:Ask HN: What was the best CS paper you read in 2017? by Eridrus on Saturday December 30, 2017 @01:22PM (#16036544)
The article you link ends on a pretty weak claim, math didn't obsolete biologists and ML won't obsolete systems folks, but every time you write a heuristic you would probably get better results from a model.
Re:Ask HN: What was the best CS paper you read in 2017? by robotresearcher on Saturday December 30, 2017 @03:11PM (#16037237)
A heuristic is a model. A successful heuristic encodes knowledge of the distributions at hand. Heuristics are designed by people who had good insight into the data rather than learned directly from data, but they are models in the same sense.
Re:Ask HN: What was the best CS paper you read in 2017? by chubot on Sunday December 31, 2017 @02:04AM (#16039720)
It's not anywhere near as simple as "replace heuristic with model". This paper is a good one to disabuse yourself of that notion:

https://research.google.com/pubs/pub43146.html

This is from the team at Google with the longest experience deploying machine learning (early 2000's, pre-deep learning).

(Contrary to popular belief, machine learning was basically unused in Google's search ranking until pretty recently.)

Re:Ask HN: What was the best CS paper you read in 2017? by yazr on Saturday December 30, 2017 @01:22PM (#16036539)
Can you please give some examples of resource-mis-allocations ?!

AFAIK storage is not the system bottle it used to be. We always want more, but network and cores are relatively plentiful.

If we could magically (and safely) modify the software stack, which areas could give x2 or x3 improvements ?

Re:Ask HN: What was the best CS paper you read in 2017? by chubot on Sunday December 31, 2017 @02:19AM (#16039753)
As far as Google goes, the easiest place to get better end-user latency/performance (2x-3x) is ... fixing the JavaScript.

I'm being totally serious. Backends are generally fast, and the backend engineers are performance-minded.

Front end engineers are not as cognizant of performance (somewhat necessarily, since arguably they have a harder problem to solve). Back in the mid-2000's, Gmail/Maps/Reader days Google had a lot of great JS talent, but it seems to have ceded some of that ground to Facebook and Microsoft.

If you have heard Steve Souders speak, he always mentions that he was a backend guy. Until he actually measured latency, and realized that the bottleneck is the front end. That was at Yahoo, but it's very much true for Google too.

http://stevesouders.com/bio.php

I would like to see a machine learning system rewrite JavaScript code to perform better and make UI more usable. I believe that's beyond the state of the art now, but it's probably not out of the question in the near future.

-----

As far as scheduling that was just one example of an important systems problem that hasn't been solved with machine learning. Not saying it can't be, of course. Just that this is a research direction and not a deployed system.

It's also important to note that there are plenty of other feedback-based/data-driven algorithms for resource management that are not neural nets. If neural nets work, then some simpler technique probably works too.

Re:Ask HN: What was the best CS paper you read in 2017? by MaxBarraclough on Sunday December 31, 2017 @07:41PM (#16043915)
> I would like to see a machine learning system rewrite JavaScript code to perform better

Well sure, we all want a God compiler.

Re:Ask HN: What was the best CS paper you read in 2017? by sulam on Saturday December 30, 2017 @03:40PM (#16037449)
Network latency right now is the biggest issue we have. If we could magically (using your term here!) get computational resources and data dramatically closer to end users, it would easily give 2 or 3x improvement. Doing this safely of course means consistently in this case, and being able to solve things like safe replication of large data sets. I dunno how to do it, but you asked and that's the biggest thing I can think of.
Re:Ask HN: What was the best CS paper you read in 2017? by yazr on Sunday December 31, 2017 @02:32AM (#16039781)
So backend-to-frontend latency?

Or are there also plenty server-to-server scenarios?

Re:Ask HN: What was the best CS paper you read in 2017? by yazr on Sunday December 31, 2017 @03:41AM (#16039888)
After re-reading your comment, are you referring to end-users inside the enterprise perimeter ?

e.g. devs using remote build system ? A local workload which access a mostly-remote db ?

Re:Ask HN: What was the best CS paper you read in 2017? by rgrieselhuber on Saturday December 30, 2017 @12:49PM (#16036325)
Any resources you can recommend on the scheduling topic?
Re:Ask HN: What was the best CS paper you read in 2017? by chubot on Sunday December 31, 2017 @02:33AM (#16039784)
As mentioned, that was off the top of my head. Some of it is "inside baseball" at Google, but there are a bunch of published papers about cluster scheduling. This one is a good overview, and has numbers, evaluation, lessons learned, etc.:

https://research.google.com/pubs/pub43438.html

My overall point is that even if learned indexes replace traditional data structures (which is a big if), plenty of important systems problems that remain. Some that I could think of:

- Fixing front end performance as mentioned in a sibling comment.

- System administration of a billion Android phones. The state of these seems pretty sorry.

- Auditing app stores for security bugs.

- Eliminating security bugs by construction. Hell, even just eliminating XSS.

- Software that runs transparently in multiple data centers. (Spanner is a big step in that direction, but not a panacea.)

I could name like 10 more... none of these have anything to do with learned indexes. The point is that the OP is generalizing from a really specific technique to some kind of hand-wavy "machine learning writes all the code" secnario.

Re:Ask HN: What was the best CS paper you read in 2017? by rgrieselhuber on Monday January 01, 2018 @12:33PM (#16046981)
Thanks!
Re:Ask HN: What was the best CS paper you read in 2017? by sulam on Saturday December 30, 2017 @01:05PM (#16036424)
I can't find the exact paper, but you can find a lot after reading this article popularizing the topic:

https://www.theverge.com/2016/7/21/12246258/google-deepmind-...

The future is here. :)

Re:Ask HN: What was the best CS paper you read in 2017? by eggie5 on Saturday December 30, 2017 @02:00PM (#16036779)
Interesting article I read from Zalando, which in the same vein as the Learned Indexes paper, takes a previously computationally expensive routine (Optimal Cart Pick) and learns it as an approximation to a complex function that, in the end, has faster run-time.

https://jobs.zalando.com/tech/blog/accelerating-warehouse-op...

Re:Ask HN: What was the best CS paper you read in 2017? by sulam on Saturday December 30, 2017 @02:08PM (#16036833)
Cool!
Re:Ask HN: What was the best CS paper you read in 2017? by godelmachine on Saturday December 30, 2017 @01:59PM (#16036772)
There was a time when people used to get PhD's for researching on index. This paper actually turns the table.
Re:Ask HN: What was the best CS paper you read in 2017? by eggie5 on Saturday December 30, 2017 @02:00PM (#16036783)
nice pun
Re:Ask HN: What was the best CS paper you read in 2017? by sova on Saturday December 30, 2017 @02:32PM (#16037000)
Yo! This is what I'm talkin' about! Replace directories with self-consistent neural nwots [neural blackbox thingie of weights and activation vals]. It's cool, but for every convenience we take in the direction HD space we backpeddle in processing [meaning, although the dir structure could be super condensed this way with a learned index, this approach is less flexible to cold or not-cpu-related analysis]. It's very cool actually to consider the three branches of processing, hdd, and memcache ... You want to have a balance but in the ideal computer we do no calculation, and that is something worth mentioning.

Reading again of the abstract, allow me to add that it's an optimization beyond structures such as Btrees which are already not really decipherable datasets to the naked eyes. So any optimization in a space that's not designed to be human-legible can take whatever shape, and this is certainly a welcome achievement!

Re:Ask HN: What was the best CS paper you read in 2017? by smsx on Sunday December 31, 2017 @01:59AM (#16039704)
> but in the ideal computer we do no calculation, and that is something worth mentioning

Can you expand on this bit? I'm not sure I understand what you mean

Re:Ask HN: What was the best CS paper you read in 2017? by sova on Sunday December 31, 2017 @07:23AM (#16040339)
Absolutely! This is a statement on minimization of computational effort. When the solution has already been provided we need not do any calculation. One way to think about the quoted statement and how I meant it is to consider big O notation and how some operations take O(n) or (O lg n) steps dependent on input in order to reach a solution or complete a process or spit out a result; in this hypothetical best case our operations all take O(1). This is not really a calculation but in fact knowledge coming to light.

Since writing this comment I have text-to-speech'd the whole of the article and I listened to it one afternoon over smooth classical music and I have come to appreciate the fact that many computers will have neural network processors like tensor processors or at the very least really good GPU, making it all the more likely that such algorithms [especially used in the specific case of fault intolerant data organization and file hierarchy] will actually not require so much computational effort as traditionally believed.

Re:Ask HN: What was the best CS paper you read in 2017? by AlexTelon on Saturday December 30, 2017 @12:08PM (#16036117)
A very interesting read indeed!

Besides HN how can one find great papers like this? How did you find out about it?

Re:Ask HN: What was the best CS paper you read in 2017? by godelmachine on Saturday December 30, 2017 @02:02PM (#16036795)
1) The Morning Paper - blog.acolyer.org - A new super interesting paper review everyday

2) This is my personal ritual. Every weekday I check out recent entries in "Hardware architectures" and "Emerging Technologies" section of arXiv.org Many other sections are gaining traction with me, like Database.

Hope this helps.

Re:Ask HN: What was the best CS paper you read in 2017? by juanmirocks on Saturday December 30, 2017 @02:11PM (#16036855)
Thank you for The Morning Paper
Re:Ask HN: What was the best CS paper you read in 2017? by travmatt on Saturday December 30, 2017 @02:55PM (#16037131)
You'd also like Fermat's Library
Re:Ask HN: What was the best CS paper you read in 2017? by godelmachine on Sunday December 31, 2017 @01:21AM (#16039621)
Oh yes, I do read Fermat's library, but that's more into pure mathematics side, which means I need to put in 3X the efforts to understand the papers, which I do.
Re:Ask HN: What was the best CS paper you read in 2017? by dekayed on Saturday December 30, 2017 @01:08PM (#16036452)
I'd recommend taking a look at Papers We Love

https://github.com/papers-we-love/papers-we-love

Re:Ask HN: What was the best CS paper you read in 2017? by rmk on Saturday December 30, 2017 @07:22PM (#16038521)
Loved the two-minute papers channel that I came across on this list. Thanks!
Re:Ask HN: What was the best CS paper you read in 2017? by sulam on Saturday December 30, 2017 @01:05PM (#16036427)
I found this paper after reading through Jeff Dean's talk at NIPS. I recommend that, too, obviously!

http://learningsys.org/nips17/assets/slides/dean-nips17.pdf

You can generally find a paper for each section.

Re:Ask HN: What was the best CS paper you read in 2017? by CaHoop on Saturday December 30, 2017 @12:34PM (#16036241)
I saw this paper on reddit.com/r/machinelearning - usually the more interesting ML papers are posted there.

Additionally, there is http://www.arxiv-sanity.com/ which sorts new machine learning papers by popularity.

Re:Ask HN: What was the best CS paper you read in 2017? by allcentury on Saturday December 30, 2017 @11:58AM (#16036060)
That was a good read, thanks for sharing this.
Re:Ask HN: What was the best CS paper you read in 2017? by catnaroek on Saturday December 30, 2017 @01:07PM (#16036444)
I've read that paper, and I wasn't particularly impressed. Is there any concrete evidence that learned indices scale to databases with complex schemata and a large transactional volume? Could learned indices be profitably used, say, in the database backend of an ERP system?
Re:Ask HN: What was the best CS paper you read in 2017? by sulam on Saturday December 30, 2017 @01:19PM (#16036520)
There are immediate applications to data warehousing. I hope that's obvious to you, but if not I'm happy to unpack that.

Whether or not it applies to online databases probably depends on several factors. The ones I can think of off the top of my head are the read/write ratio, the write rate in general, and obviously size of your data set (although the approach works at GB, not TB, so most can take advantage).

Here's a way, I, a systems engineer who doesn't design databases, could imagine using it immediately:

1) Do I have any indexed queries? If not, nothing to do here. 2) Does the data change rapidly? If so, nothing to do here. 3) Okay, now I'm in the zone of profitability:

1) investigate just letting the model do all the work. This is unlikely to be successful in many cases, but it's pretty easy to try.

2) investigate "model-assist", in this mode I let the model give me an answer and, if I don't like it, I use the B-tree. The model is fast enough that this is not a huge hit to my overall performance.

3) investigate "model-replace", in this mode I build my b-tree and do everything like normal. In the meantime I'm training my model. Once my model seems well-trained (I could hand it a randomized subset of queries and, once the accuracy and performance beats the b-tree I consider it well-trained), I switch to using it. As data changes I could potentially go back to the b-tree, update the model (literally throw it away and re-build) and do it again.

4) Investigate "co-opetition" -- make the b-tree a component of the model. If you read the paper, you see how they layer different models. A b-tree is just a particular kind of model that happens to be computationally expensive but has high accuracy. You could include it in the model graph and let it compete for queries like everything else.

Anyway, I'm speculating here, but it seems obvious this has immediate impact in one large space relating to databases (data warehousing) and potential impact in many of the rest.

Re:Ask HN: What was the best CS paper you read in 2017? by catnaroek on Saturday December 30, 2017 @02:54PM (#16037124)
> There are immediate applications to data warehousing.

I am not too worried about data warehouses. Data warehouses can be fed by batch processes, which you can run, say, once every day or once every week. This leads to the design of algorithms that optimize aggregate measures of performance (e.g. amortized complexity, average complexity, throughput) rather than microscopic measures of performance (e.g. worst-case complexity, latency). Machine learning techniques have a track record of delivering good aggregate results.

However, online databases require optimal worst-case performance. The occasional massively slow operation is not okay - we'd rather every operation be a tiny bit slower instead.

> Do I have any indexed queries? If not, nothing to do here.

Of course I do. Needless to say, complex schemata come with lots of indices that are necessary to speed up queries that pull data from 10-15 tables each.

> Does the data change rapidly? If so, nothing to do here.

Of course the data changes rapidly. Crucially, an online transactional database's input comes from external parties (e.g., public-facing web servers) that cannot be considered trustworthy. Many machine learning techniques are vulnerable to so-called “adversarial examples”. Feeding adversarial examples to an ML-powered index could cause the database's performance to drop drastically in ways that are provably not possible with B-trees.

Re:Ask HN: What was the best CS paper you read in 2017? by sulam on Saturday December 30, 2017 @03:17PM (#16037269)
So, would you take a bet that this won't have been used in any self-evident way within the next 5 years?

Because I would take the other side of that bet. :)

Re:Ask HN: What was the best CS paper you read in 2017? by catnaroek on Saturday December 30, 2017 @03:21PM (#16037295)
I'm not in the business of predicting the future, since that is beyond my control. What other people do with learned indices is up to them.

I'm just stating my concerns.

Re:Ask HN: What was the best CS paper you read in 2017? by oh-kumudo on Saturday December 30, 2017 @02:36PM (#16037026)
Data warehousing is one obvious application: data is immutable; have a sort key. So NN as a builtin once index structure is perfect for such case. It is only a matter of time for commercial analytic DB to pick up this idea, I would presume.
Re:Ask HN: What was the best CS paper you read in 2017? by catnaroek on Saturday December 30, 2017 @03:39PM (#16037442)
You're right, data warehousing seems like a compelling use case for learned indices. I'm primarily worried about OLTP systems, though.