The researchers started by sketching out the problem they wanted to solve in Python, a popular programming language. But they left out the lines in the program that would specify how to solve it. That is where FunSearch comes in. It gets Codey to fill in the blanks—in effect, to suggest code that will solve the problem.

A second algorithm then checks and scores what Codey comes up with. The best suggestions—even if not yet correct—are saved and given back to Codey, which tries to complete the program again. “Many will be nonsensical, some will be sensible, and a few will be truly inspired,” says Kohli. “You take those truly inspired ones and you say, ‘Okay, take these ones and repeat.’”

After a couple of million suggestions and a few dozen repetitions of the overall process—which took a few days—FunSearch was able to come up with code that produced a correct and previously unknown solution to the cap set problem, which involves finding the largest size of a certain type of set. Imagine plotting dots on graph paper. The cap set problem is like trying to figure out how many dots you can put down without three of them ever forming a straight line.

  • Mahlzeit@feddit.de
    link
    fedilink
    English
    arrow-up
    45
    ·
    11 months ago

    FunSearch (so called because it searches for mathematical functions, not because it’s fun)

    I’m probably not the only one who wondered.

  • thesmokingman@programming.dev
    link
    fedilink
    English
    arrow-up
    28
    arrow-down
    1
    ·
    edit-2
    11 months ago

    Buried the fucking lede with misleading garbage. They came up with new, larger cap sets than were previously known. That’s cool, but it doesn’t actually prove anything related to open cap set conjectures. I’d contend this is similar to the early solutions of the four-color map theorem albeit built with a computer coming up with the models to brute force. Pretty fucking neat; not solving an unsolvable problem by any stretch of the imagination. I would expect that kind of hyperbole from the lay press not the fucking MIT Review.

    Edit because this shit is really cool: I intentionally linked this to the four color map theorem because that was the first brute force proof (at least via computer). Lots of people got pissed at the authors and said it was invalid because they reduced their special cases to a finite set and had a computer chug through them. imo proof by computer is valid and one of the ways stuff like this can aid math. There are so many problems in combinatorics alone that could benefit from this treatment of just getting new, unknown special cases to get to a general case or handling previously too large finite sets of special cases.

      • Victor@lemmy.world
        link
        fedilink
        English
        arrow-up
        7
        arrow-down
        1
        ·
        11 months ago

        Kind of abusing the word there a bit though eh. Maybe call them something like “really feggin hard problems” instead.

      • thesmokingman@programming.dev
        link
        fedilink
        English
        arrow-up
        3
        ·
        11 months ago

        This is mostly incorrect. There are provably unsolvable problems and unsolved problems. Many times someone will mislabel the latter as the former; that doesn’t make it actually provably unsolvable. Often we suspect unsolved problems might be unsolvable but do not go to the extreme of claiming it until it’s proved impossible to solve.

  • AutoTL;DR@lemmings.worldB
    link
    fedilink
    English
    arrow-up
    5
    ·
    11 months ago

    This is the best summary I could come up with:


    Google DeepMind has used a large language model to crack a famous unsolved problem in pure mathematics.

    In a paper published in Nature today, the researchers say it is the first time a large language model has been used to discover a solution to a long-standing scientific puzzle—producing verifiable and valuable new information that did not previously exist.

    FunSearch (so called because it searches for mathematical functions, not because it’s fun) continues a streak of discoveries in fundamental math and computer science that DeepMind has made using AI.

    Built on top of DeepMind’s game-playing AI AlphaZero, both solved math problems by treating them as if they were puzzles in Go or chess.

    It combines a large language model called Codey, a version of Google’s PaLM 2 that is fine-tuned on computer code, with other systems that reject incorrect or nonsensical answers and plug good ones back in.

    Terence Tao at the University of California, Los Angeles, who has won many of the top awards in mathematics, including the Fields Medal, called the cap set problem “perhaps my favorite open question” in a 2007 blog post.


    The original article contains 821 words, the summary contains 185 words. Saved 77%. I’m a bot and I’m open source!

    • BetaDoggo_@lemmy.world
      link
      fedilink
      English
      arrow-up
      3
      ·
      11 months ago

      They basically found a more effective way to brute force the problem. I don’t doubt that it’s possible. The title calling it unsolvable is nonsense though.

  • yesman@lemmy.worldOP
    link
    fedilink
    English
    arrow-up
    9
    arrow-down
    8
    ·
    11 months ago

    I thought this was interesting bc it’s an instance where a LLM has done something undeniably novel and unique while expanding human understanding. It’s a chink in the armor of the idea that a LLM is a “stochastic parrot” that can only regurgitate and never create.

    I’ve been toying with this idea that LLM are showing us that what we thought of as creativity, learning, and problem solving aren’t as rarefied as we thought. We know that AI isn’t conscious, maybe consciousness isn’t as prerequisite to behaviors and cognition as we thought.

    • jacksilver@lemmy.world
      link
      fedilink
      English
      arrow-up
      5
      arrow-down
      1
      ·
      11 months ago

      I’m not so sure, it feels a lot more like the https://en.wikipedia.org/wiki/Infinite_monkey_theorem, but with a model helping limit the outputs so they are mostly usable. As is stated in the article, it took millions of runs and couple of days to get the results. So its more like brute forcing with a slightly modified genetic algorithm than anything else.

      I didn’t see a link to the full article, so maybe something more creative is happening behind the scenes, but it seems unlikely.

      • thesmokingman@programming.dev
        link
        fedilink
        English
        arrow-up
        3
        arrow-down
        1
        ·
        11 months ago

        Your interpretation is correct. There’s no new logic here, just new special cases of a problem whose general solution is still unknown. I think it’s pretty cool and has a lot of value in places like design theory where the getting examples to try and play around with general solution ideas is really tough. But all it did was creatively crunch numbers.