Slashdot Mirror


IBM's Question-Answering System "Watson" Revisited

religious freak writes "IBM has created and made the question answering algorithm, Watson, available online. Watson has competed in and won a majority of (mock) matches against humans in Jeopardy. Watson does not connect to the Internet to answer his questions, but rather seeks answers using many different algorithms then employs a ranking algorithm to choose the best answer." We mentioned Watson last year as well.

34 of 170 comments (clear)

  1. I'll take Ken Jennings for the block... by LostCluster · · Score: 4, Informative

    Part of the deal with Jeopardy! is that they will have as part of the 2010-2011 season be a televised episode in which record-breaking champ Ken Jennings will play against Watson, with a to-be-named-later champion in the third slot. This has been in the works since 2009, but the staff of the show finally thinks the system is ready for it's televised match.

    One key factor is how the human behavior will change when prize money is at stake. Jennings has proven in numerous appearances on GSN that he's willing to play in any test of knowledge and the fact that he knew he was Jeopardy's first millionaire in regular season play didn't stop his long Jeopardy! run. He also studied for the show, particularly alcoholic beverages (which he doesn't drink) because he had seen the Potent Potables category on TV.

    But, what about that player-to-be-named later? Will they know more than the grad students... and play the game not as if it's for points but real dollars?

    1. Re:I'll take Ken Jennings for the block... by paeanblack · · Score: 5, Funny

      But, what about that player-to-be-named later?

      They're fucked.

  2. Tune in a half-hour early... by LostCluster · · Score: 5, Funny

    and see students from the MIT Robotics Lab test their machine that they say can avoid the Bankrupts and find that Million Dollar wedge on the Wheel of Fortune!

    1. Re:Tune in a half-hour early... by LostCluster · · Score: 2, Funny

      Elsewhere on the TV dial...

      H&R Block's mainframe system has computed that all of the the offers on Deal or No Deal are bunk, you're always statistically better off sticking with your case through most of the game... but they're still unsure whether you should take Howie's offer to switch your case with the last one left in the hands of the models.

      A tragedy as the Stanford-built computer made to play Russian Roulette was caught not in the lead when time was called in the second round, and was dropped by the random must-drop-somebody spin. It suffered the series first fatal injury as the fall broke it's hard disk. It will not be rebult.

      Amazon.com's entry onto The Price is Right was disqualified from the Human-vs.-Machine Day event after it was learned that it was powered by Mechanical Turk.

      Priceline.com's robot blundered today by deciding to keep the trip to Spain when it declined to play the Big Deal, and had to watch a woman dressed as Clown get the new Chevy Volt on today's Let's Make of the Deal.

    2. Re:Tune in a half-hour early... by Ambiguous+Puzuma · · Score: 3, Insightful

      I don't care for the show myself, but don't forget about the nonlinear utility function of money. As an illustration, given that I'm comfortable but not wealthy:

      If given a choice between a guaranteed $400 and a 50-50 shot at $1,000, I'd choose the latter. The money wouldn't have a major impact on my life, so I'd go for the option with the best expected return.
      If given a choice between a guaranteed $400,000 and a 50-50 shot at $1,000,000, I'd take the guaranteed $400,000, even though the expected return of the latter situation is $500,000. $400,000 would give me a substantial amount of freedom and security. An additional $600,000 beyond that would be nice but would provide relatively few benefits compared to the initial $400,000.

      Now, if I were already a millionaire, I'd most likely choose the 50-50 shot at $1,000,000.

    3. Re:Tune in a half-hour early... by tlhIngan · · Score: 2, Interesting

      and see students from the MIT Robotics Lab test their machine that they say can avoid the Bankrupts and find that Million Dollar wedge on the Wheel of Fortune

      With a little empirical testing, it should be possible. Bankrupts are at known positions on the wheel, and you know the starting location. If you can model the physics of the wheel well enough, you can easily avoid them. (Unless the wheel has external influences - e.g., a brake and a motor that randomly apply and remove energy from the wheel making it less predictable).

      Million dollar wedge is a bit more difficult, but given such wedges are covered up by something else, it may be possible to detect them looking at the high-def (and high-def 3D stream). Maybe during a few spins it may be possible to detect what's underneath it and detect the coloring.

    4. Re:Tune in a half-hour early... by Hatta · · Score: 2, Interesting

      Winning a huge monetary prize is usually quite destructive.

      There's a solution for that. Don't be a douchebag. I realize this is difficult for a large proportion of society.

      --
      Give me Classic Slashdot or give me death!
    5. Re:Tune in a half-hour early... by inio · · Score: 2, Interesting

      Don't the same forces at work in the Monty Hall Problem make it not 50/50, or does the fact that the eliminated "losers" were randomly selected without foreknowledge that they're losers make it 50/50?

  3. Re:Well, this is no good by LostCluster · · Score: 2, Interesting

    Why can't I ask it my own questions?

    Because, like Deep Blue at its time, it requires much more computing power than today's typical web site or PC. Chess has finally been solved to the point that there's now unbeatable AIs available to the average user (assuming it gets to move first) but Jeopardy! hasn't, which is why this is novel. It'll take several more years of computing power increases before we'll be playing this AI on our home video game systems.

  4. I'll be impressed by Kitkoan · · Score: 5, Interesting

    If it can properly rate if these people are hot or not.

    --
    Attention... all grammer nazi"s! Is they're anything; wrong with: my post,
    1. Re:I'll be impressed by sorak · · Score: 2, Funny

      If it can properly rate if these people are hot or not.

      I think we need a site called "bot or not". You look at someone's browsing history and determine the likelihood that their system is infected.

  5. I have only one question... by bobdotorg · · Score: 5, Funny

    What is the air speed velocity of an unladen swallow?

    --
    __ Someday, but not this morning, I'll finally learn to use the preview button.
    1. Re:I have only one question... by LostCluster · · Score: 3, Funny

      Was this bird affected by the BP oil spill or not?

    2. Re:I have only one question... by Brett+Buck · · Score: 2, Funny

      I don' t know that... AAAARGH!

    3. Re:I have only one question... by Spikeles · · Score: 2, Informative
      --
      I don't need to test my programs.. I have an error correcting modem.
  6. Re:Well, this is no good by Quackers_McDuck · · Score: 5, Informative

    Chess has finally been solved to the point that there's now unbeatable AIs available to the average user (assuming it gets to move first)

    There are no unbeatable AIs for chess yet, that would imply chess is a solved game (http://en.wikipedia.org/wiki/Solving_chess). It doesn't make much of a difference who moves first, either.

  7. Re:Well, this is no good by Animats · · Score: 4, Informative

    Chess has finally been solved to the point that there's now unbeatable AIs available to the average user (assuming it gets to move first)...

    No, checkers has been solved to that point. The solution is available online. Perfect play leads to a draw.

    Computer chess is merely at the point that if you haven't been on the cover of Chess Life, you're going to get trounced. Even if you have, you're going to lose more than you win. The current situation is that Deep Rybka 2010 has an ELO rating around 3150. That's running on a 4-core AMD-64 desktop machine. The all-time human record is 2851, which Garry Kasparov had in 1999-2000.

  8. Re:Well, this is no good by Jane+Q.+Public · · Score: 4, Insightful

    This is a given, since there aren't even any AIs yet, so there could be no unbeatable AIs.

    I admit that as a programmer this is a bit of a pet peeve of mine. But people: computers are NOT "intelligent". At all. They do what they do by performing the same specific instructions over and over and over again. That's what computers are good at. Granted, they do more complex things today, but that's just due to clever programming and the ability to do many more instructions many times faster than before (i.e., better hardware and software). But that's just quantity. What it lacks is quality. No matter how clever a combination of processors and program may seem at some specific task, it totally lacks the quality we call "intelligence". To call anything running on a computer today "intelligent" is to undermine the word itself. You might as well call a rock an airplane.

    Researchers in this field 20 years ago would have been appalled at what people today refer to as "AI". Of course they would also be appalled at the lack of progress in that same field, but that's another matter.

    I am not pointing fingers at the posters here. They are just using "AI" in the way it has become commonly used. But that is an erroneous use and I would be happy to see the practice stop. It gives people the wrong idea.

    If we (erroneously) call what occurs today "intelligent", then if something ever really did become intelligent, what would we call it?

  9. Re:Well, this is no good by Vellmont · · Score: 5, Insightful


    To call anything running on a computer today "intelligent" is to undermine the word itself. You might as well call a rock an airplane.

    I didn't realize "intelligent" had such a clear definition that you could really say anything meaningful about whether a machine was "intelligent" or not.


    If we (erroneously) call what occurs today "intelligent", then if something ever really did become intelligent, what would we call it?

    I don't know.. perhaps we'd make a bit of progress and realize that "intelligence" isn't some nice single concept to just nail down like mass that we can all agree on what is is and isn't. We might even come up with 10 very different words to describe something we might now use the word intelligence about, since we might actually have a better grasp on what it actually is. If you ask me, intelligence is more about human ego than any real hard definitions. In many peoples minds computers can never be intelligent because it would bring our self opinions down a notch or two. That's why many people were sooo upset about Kasparov getting schooled by Deep Blue 10+ years ago, and then made up a bunch of excuses why it wasn't fair.

    Whether a machine "intelligently" plays Chess, or is "intelligent" is a stupid question. What's more interesting is how we might accomplish the same task in different ways than our brains might do so. 40 years ago nobody ever thought a computer could be programmed to play even a decent game of chess. These days it's surpassed us. I think that says more about what we think is "intelligent" than anything else.

    --
    AccountKiller
  10. Re:Well, this is no good by Quackers_McDuck · · Score: 4, Informative

    As humans, we do exactly what physics mandates we do. Unless you're purporting that the human brain uses some sort of hypercomputation or that there's something special (ie outside of our current understanding of physics) about what neurons do, you're not being consistent.

    That said, I understand where you're coming from; most AI research is in very narrow domains and has no intention or hopes of solving the problem of achieving human-level intelligence (Watson is an example of narrow AI, as it clearly lacks a genuine understanding of the question or the english language). But the fact remains, that is how the term AI is used.

    There's a growing separation between this "Narrow AI" and the kind of AI you seem to be hoping for, Artificial General Intelligence (AGI). There are some AGI projects out there, such as the open source opencog. Since there's no hope of people stopping calling things like computer chess AI, I prefer to use the term AGI whenever referencing "real" AI.

  11. Re:Well, this is no good by Raptoer · · Score: 3, Interesting

    To shorten your post: AIs will exist when a computer can write code for itself to run without interaction from a user. Given a problem, and having no prior knowledge of a solution, nor a way to arrive at the solution, an AI will be capable of creating a set of instructions to solve that problem.

  12. I lost on Jepordy by Black+Gold+Alchemist · · Score: 3, Funny

    Against a programmer, oh, and an algorithm, both with a PhD....

    -Weird Al Parodied

    --
    Responsibility is an addiction
    Virtue is a temptation
    Community is a cartel
    1. Re:I lost on Jepordy by Yaos · · Score: 2, Funny

      I took Potpourri, for 100, and my head started to spin.

  13. Re:Well, this is no good by dlgeek · · Score: 3, Interesting

    It's impossible to fully all possible games of chess. The game tree complexity is about 10^123, whereas the number of atoms in the universe is thought to be somewhere between 10^79 and 10^81. Thus, it's impossible to brute force the game since you can't store all the possible states.

    If, however, we ignore this, then the answer to your question would be "it depends on how fast it could calculate the results." Some hypothetical computer with sufficient memory and a sufficiently fast processor would be unbeatable using a brute force algorithm by the definition of brute forcing. However, as already explained the "sufficient memory" part is pretty much impossible

  14. Re:Well, this is no good by maxwell+demon · · Score: 2, Interesting

    It's impossible to fully all possible games of chess. The game tree complexity is about 10^123, whereas the number of atoms in the universe is thought to be somewhere between 10^79 and 10^81. Thus, it's impossible to brute force the game since you can't store all the possible states.

    While you're right that it's impossible, the reason you give is wrong: You wouldn't have to store all the possible states at once. After you've determined that you cannot win with a certain move, you don't need to store all those states this move can lead to. And if you determined a winning move, you only have to store the sequence of winning moves. The real problem is time. Even if you could check one move per Planck time (the shortest possible time interval, ca. 5*10^-44s), you'd still need about 5*10^79 seconds, or about 1.5*10^72 years. For comparison, the universe is about 1.5*10^9 years old.

    --
    The Tao of math: The numbers you can count are not the real numbers.
  15. Re:Well, this is no good by Jane+Q.+Public · · Score: 2, Interesting

    Ahem. I did that myself and I should clarify this. "Artificial" can mean "fake", but the original meaning was "workmanship" or "craft". Created by hand.

  16. Re:Well, this is no good by bonaldo2000 · · Score: 2, Insightful

    I don't know.. perhaps we'd make a bit of progress and realize that "intelligence" isn't some nice single concept to just nail down like mass that we can all agree on what is is and isn't. We might even come up with 10 very different words to describe something we might now use the word intelligence about, since we might actually have a better grasp on what it actually is. If you ask me, intelligence is more about human ego than any real hard definitions. In many peoples minds computers can never be intelligent because it would bring our self opinions down a notch or two. That's why many people were sooo upset about Kasparov getting schooled by Deep Blue 10+ years ago, and then made up a bunch of excuses why it wasn't fair.

    How convenient! A theory about intelligence which means that we have actually already created AI!

    Get back to work!

  17. Re:Well, this is no good by bertok · · Score: 2, Funny

    The real problem is time. Even if you could check one move per Planck time (the shortest possible time interval, ca. 5*10^-44s), you'd still need about 5*10^79 seconds, or about 1.5*10^72 years. For comparison, the universe is about 1.5*10^9 years old.

    You're forgetting that speed and parallelism aren't mutually exclusive!

    If you could somehow convert all of the matter in the universe into a massively parallel computer running at that speed, with each CPU having a budget of ~40 million particles, then you'd have a computer that could play chess perfectly, providing each move in about 24 hours at first, and then probably speeding up a bit as the game progresses and there's less of the state space to check.

    Your homework for tonight is to build two such computers using different methods, and compare the relative merits of each solution. Show your work.

  18. Re:Well, this is no good by shadow_slicer · · Score: 2, Informative

    Computers are not intelligent because they are unable to reason. They iterate until they achieve an optimal solution to a specific set of rules.

    Could you define "reason"? The AI field has worked for a while (until the 80s) to build machines that reason. There were some successes with expert systems and things like that (which, given sufficient data could "reason" according to standard definition). The problem with them is that they need complete information, so they never really made it out of the lab. Current works have turned instead of "reasoning" systems to Bayesian inference engines which use complicated statistical methods and approximations to find the most likely answer. They build estimates of probability distributions based on training (equivalent to experience) and then can use them to make decisions or predictions. They are much more flexible than the reasoning machines that were build before and handle incomplete data appropriately.

    These probably don't "reason" by your definition, but then again, neither does the human brain: the current understanding of cognition suggests that it is also a inference engine, making probabilistic judgments based on experience in spite of limited information.

    If these methods count as AI, then AI already exists. It is used in everything from handwriting and speech recognition to ranking players on XBox Live. If you look at the tasks that AI researchers hoped to solve when research in AI began, a large number of them have been solved. So if a computer can solve a problem that was previously considered an AI problem, wouldn't it be "moving the goal posts" to say that we don't have any AI today?

  19. Re:Back to the drawing board by KingSkippus · · Score: 2, Insightful

    I killed it, too, but mainly because of the rules of the game in which I get first crack at the answer.

    Still, I think the point is that it's impressive the number of questions it gets right. I really didn't miss very many. My mental tally had it getting around 70% or so, which is pretty damn good. I got around 80%, but again, I had first crack at the answer, so Watson could have only possibly scored around 20% of the answers at best. If it tallied your score and Watson's score without actually competing head-to-head, that probably would have been a more interesting challenge. Keep in mind that as a computer, if the programmers chose to do so, they could probably have Watson answering everything pretty much simultaneously. Also, Jeopardy! is a lot about timing, hitting that button as soon as the buttons are unlocked, so in that respect, Watson probably really could kick ass in that its reaction time will always be faster than yours.

    Just because I won doesn't make the technology not interesting or significant. Frankly, I'm impressed that it's even able to answer 20% of the questions expressed in natural language correctly.

  20. Re:Well, this is no good by JasterBobaMereel · · Score: 2, Insightful

    The real issue is that AI research has mainly discovered that Intelligence is not well defined, and everything we thought was difficult (e.g. Playing chess) is relatively easy, and everything we thought was easy (e.g. Understanding Human Language) is horrifically difficult

    A human child can walk, see interact and understand it's environment, hold a conversation ... none of these can be done even more than adequately by machines .. (Walking is ahead of the rest so far) but a cheap chess computer can beat most people, including most Grand Masters the majority of the time

    --
    Puteulanus fenestra mortis
  21. Re:Back to the drawing board by moeinvt · · Score: 2, Interesting

    Back to the drawing board my arse. You may have beaten the web page game easily, but consider the fact that you wouldn't get first shot at every single question in a real match. If you assume 50-50 on the ring-in time when both players think they have the right answer, I think Watson looks pretty good on this game (although they wouldn't have put an example of a particularly bad match on the web).

    It also has a probability threshold below which it won't attempt a response. The real machine must be set up so that if it's behind in the score late in the game, it would ring in with its highest probability "guess". That would make things more interesting. Think of "Final Jeopardy" too. If the machine can get >50% of the point leader's score, the match is totally up for grabs.

    People that go through the qualifying process to appear on the show are definitely on the upper end of the intellect/knowledge bell curves, so that would be a tough challenge. I totally believe that the machine would crush the "average" person.

  22. similar and different from Google Search by peter303 · · Score: 2, Interesting

    Both Watson and Google relied on statistically analyzed word occurrences with a veneer of procedural/rule intelligence. Waston seeks the correct answer, while Google the most popular document containing the answer. Neither incorporate "deep" understanding like CYC's rule ontology. But it may not be that necessary if the statistics are large enough.

    1. Re:similar and different from Google Search by nine-times · · Score: 2, Informative

      But it may not be that necessary if the statistics are large enough.

      It's possible, though, that the statistics can never be "large enough". I remember seeing an article here about natural language speech recognition (oh, here it is) and about how many companies had hoped to continually feed more and more examples of language use into a computer and, through statistical analysis, be able to develop human-level speech recognition. The article indicated that these companies found a point after which additional examples didn't help. The statistical analysis (at least the methods being used) leveled off around 40% while human recognition was up around 95%.

      Even when the statistical models included searching the rest of the sentence for context and calculating likely words, the recognition still failed. Part of the problem is wordplay-- sarcasm, puns, and unusual word usage. We use all kinds of contextual queues, and not just the word's context in the sentence, but things like facial expressions, tone of voice, and even an understanding of the speaker's personality. That's a lot of context for a computer to pick up on.

      What's more, when people listen to another person talking, we basically try to draw out "what the other person is saying" and then use that knowledge to fill in any blanks. So if I use a really strange word choice when talking about my wife, another married guy might understand more quickly what I'm saying by relating to his own feelings about his own wife. Until a computer has a wife, that's a level of context which will be inaccessible.

      (not everything I'm talking about in this post is in the article I cited)