Less Wrong is a community blog devoted to refining the art of human rationality. Please visit our About page for more information.

Comment author: turchin 10 October 2016 11:13:53AM 5 points [-]

If we knew that AI will be created by Google, and that it will happen in next 5 years, what should we do?

Comment author: Thomas 10 October 2016 01:56:24PM 1 point [-]

First, this is not very unlikely.

Second, be faster than them.

Comment author: ArisKatsaris 01 October 2016 02:06:43PM 1 point [-]

Games Thread

Comment author: Thomas 03 October 2016 07:22:04AM 1 point [-]
Comment author: HungryHobo 13 July 2016 10:24:37AM 1 point [-]

if you're the holders of some records for certain problem types then that grabs my interest.

I'd suggest leading with that since it's a strong one.

Comment author: Thomas 14 July 2016 04:15:03PM *  0 points [-]

The best way to win principals is to show them that a ridiculously complex constrain may be applied and calculated automatically.

  • 4.5 school hours of S per week (4 hours on odd weeks and 5 hours on even weeks)
  • when there is the fifth hour in the week, then this hour may be the second hour of the subject S on that day
  • if it is on the same day, it should be immediately after the previous hour of the subject S
  • in the above case, it must be the last hour for the teacher
  • three classes of students are divided into 5 groups for the subject S
  • there are 4 teachers for those 5 groups, one teacher teaches groups number 2 and 4
  • there is a given list of students for groups 1, 3 and 5 and a combined list for students for groups 2 and 4
  • computer should divide the combined list into two separated lists (2 and 4) but they must not differ for more than 4 students in size
  • as one of those groups (2 or 4) are always idle, the subject M which is equally divided, must be taught then - or the S should be the first hour of the day
  • for there are only 4 hours of subject M per week
  • there are only 3 teachers of M
  • there are also 3 hours of subject A per week for those same students in 5 differently set groups
  • there are 5 teachers of A, but one of them also teaches the group number 1 of S
  • it would be nice but not mandatory if the number of waiting hours for students were 0

This is a real life example, I have discussed 1 hour ago with one of the teachers (math teacher) in one of our schools. It is not the most complex demand we had, by far.

S = Slovenian language M = Math A = Anglescina (guess what that is)

Comment author: Vitor 12 July 2016 09:56:20PM 2 points [-]

Did you also test what other software (optaplanner as mentioned by HungryHobo, any SAT solver or similar tool) can do to improve those same schedules?

Did you run your software on some standard benchmark? There exists a thing called the international timetabling competition, with publicly available datasets.

Sorry to be skeptical, but scheduling is an NP-hard problem with many practical applications and tons of research has already been done in this area. I will grant that many small organizations don't have the know-how to set up an automated tool, so there may still be a niche for you, specially if you target a specific market segment and focus on making it as painless as possible.

Comment author: Thomas 13 July 2016 05:25:32AM *  0 points [-]

We did some benchmarks. Sometimes we did it well, sometimes not that well.

For example in the case of Job Shop Scheduling benchmark we were unable to break a single record. There are records waiting to be break in JSS area, but we haven't broken a single one.

But we are still holding some (years old) packing records right now.

One may say, that JSS is the base of every scheduling and that packing is not. In fact, the real life scheduling is more complicated than either one of those benchmarks. We have many more constrains in real life. And it turns out, that many constrains somehow help the evolution to find trade-offs.

Comment author: Viliam 12 July 2016 07:57:08AM *  0 points [-]

Does the solution space support this? I can imagine a schedule that only violates 1 criterium, but the nearest correct solution is far away from it. (Seems to me the schedules are similar to 3-SAT in this aspect.)

Comment author: Thomas 12 July 2016 07:04:06PM 0 points [-]

Does the solution space support this? I can imagine a schedule that only violates 1 criterium, but the nearest correct solution is far away from it.

This is indeed a big and fundamental problem. If 1 criterium only is violated and this persists for many millions of generations, the control program sees this semi-solution as worse and worse. Much worse than a 2 or 4 criteriums miss. So it's then killed.

It's even more complicated than that. Several such tricks are employed and this problem almost vanishes.

Comment author: Lumifer 12 July 2016 05:24:35PM 0 points [-]

If your algorithm is actually the best-of-class for this problem, there are serious applications for it outside of schools.

Comment author: Thomas 12 July 2016 06:15:10PM 0 points [-]

I know that. But my focus in this thread are North America's schools as a big market.

But yes - how good this algorithm really is? Where is its optimal domain?

I guess, evolving algorithms is the best usage. Either from a previous known algorithm, either from scratch, either from data. Like evolving Kepler's law from planetary data. I wrote a post about that here, a few years ago.


Comment author: sdr 12 July 2016 12:16:40PM *  1 point [-]

Heads up about the business side of this: selling to primary & secondary schools, esp outside of the US, is 8/10 difficult.

Specifically, even if the teachers are fully championing your solution, they do not wield any sort of purchasing authority (and sure as hell won't pay from their own wallet). Purchasing authority's incentive-structure does not align with "teacher happiness", "optimal schedule", or most things one would imagine being the mission of the school. It is, however, critical for them to control all sw used inside the school, and might actively discourage using non-approved vendors.

Comment author: Thomas 12 July 2016 05:41:47PM *  0 points [-]

Pure economically driven decisions should win eventually.

For example we have once reduced the number of school buses from 4 to 3. 20% or 160 students come with a bus. That's 3 full buses or 4 not so full buses. It's important however, that every arriving student has a class right away. Otherwise he may want to come with a later bus, overcrowding it.

Just on time arriving of those students with just 3 buses was a logistical nightmare. But just a constrain for the digital evolution of the school schedule.

Another big saving is to eliminate the afternoon school shift. We have 2 such cases already evolved.

Comment author: HungryHobo 12 July 2016 12:57:43PM *  0 points [-]

so, parallel genetic algorithm based scheduling app with (ranked?) constraints?

In what way is it more automatic than existing similar apps?

presumably you still need to give it a list of constraints (say a few thousand constraints), possibly in a spreadsheet, some soft, some hard and it spits out a few of the top solutions or presumably an error if the hard constraints cannot be met?

What can it do that, say, optaplanner can't do?

Comment author: Thomas 12 July 2016 04:45:09PM 1 point [-]

parallel genetic algorithm

I wouldn't say it's "genetic algorithm", I prefer the term "evolution algorithm".

In what way is it more automatic than existing similar apps?

We did some testings. For example, we took some existing schedules and optimized them with our tool. The difference was substantial.

We also did some packings of circles inside a square and some spheres inside a cube, denser than it has been previously achieved.

We have built some 3D croswords 8 by 8 by 8 letters with no black field at all - field with English words.

I don't know if optalaner can do the same. I think not.

spreadsheet, some soft, some hard and it spits out a few of the top solutions

Every constrain has its own user specified weight. From 0 to 10^12 and every integer inside this interval. This is the measure of how soft or hard a constrain is.

Comment author: Vaniver 11 July 2016 03:32:32PM 1 point [-]

For that I have a software to do it automatically. Not semi-automatically like everyone else.

What optimization method are you using under the hood, if you don't mind me asking?

Comment author: Thomas 11 July 2016 03:59:38PM *  3 points [-]

Evolution. Schedules are competing for being there. Every second 10000 or so are born and are mostly killed by the control program which let live only the top schedules according to the 30+ criteria set in the script.

Random (but perhaps clever) mutation and non-random selection, that's under the hood.

At first, the top schedule is a random one and not feasible at all. After a million (or a billion, that depends) generations the first feasible one appears and from there on, evolution produces more and more perfect schedules.

For every processor core, at least one evolution is going on. Each at least slightly different one. The program can spread across many computers and there may be as many as 100 or more parallel evolutions going on. They talk occasionally (via internet) and exchange their champions.

It has been 10 years long real life experiment, which went very well. A lot of schools involved, teachers and students and some academic papers published. Now it's time to spread it.

Comment author: Viliam 11 July 2016 02:49:15PM 2 points [-]

Sounds great! I hope you don't expect average teachers to write the scripts though.

Comment author: Thomas 11 July 2016 03:13:16PM 2 points [-]

Not an average, no. But at every other school, there is at least one teacher who is able to do it (for the entire school, of course) . Some like to work in pairs when scripting it.

I thought, I might find some among readers and contributors here as well. Looking for people with this (hard) problem.

View more: Next