New research shows why you don’t have to be perfect to get the job done

This article has been reviewed in accordance with Science X’s editorial procedures and guidelines. Editors have highlighted the following features while ensuring the credibility of the content:

Fact-checked

peer-reviewed publication

trustworthy source

Proofreading


Building compact behavioral programs. (A) Top: The space of strategies to solve a task can be large, and there are many strategies that achieve sufficiently good performance. Bottom: Studying the relationships between strategies could provide insights into behavioral variability across animals and tasks. (B) General task setup: An animal makes inferences about hidden properties of the environment to guide its actions. (C) Specific task setup: An animal searches for food at two harbors whose reward probabilities change over time. (D) The optimal unconstrained strategy consists of an optimal policy coupled to an ideal Bayesian observer. (E) We formulate a constrained strategy as a small program that uses a limited number of internal states to select actions based on past actions and observations. (F) Each program generates action sequences depending on the outcomes of past actions. (G) The optimal unconstrained strategy (D) can be translated into a small program by discretizing the belief update implemented by the ideal Bayesian observer and coupling it to the optimal behavior policy. Top: Optimal belief update. Middle: Belief values ​​can be partitioned into discrete states (filled circles) characterized by the action they indicate (blue versus green). Belief update indicates transitions between states depending on whether a reward was received (solid versus dashed arrows). Bottom: States and transitions represented as a Bayesian program. (H) Top: A 30-state program approximates the Bayesian update in (G) and has two directions of integration that can be interpreted as increasing confidence in both options. Bottom: The two-state Bayesian program, Win-Stay, Lose-Go (WSLG), continues to perform the same action upon a win (i.e., receiving a reward) and switches action upon a loss (i.e., receiving a reward). (I) Example behavior generated by the 30-state Bayes program in (H). Source: Scientific advances (2024). DOI: 10.1126/sciadv.adj4064

× close


Building compact behavioral programs. (A) Top: The space of strategies to solve a task can be large, and there are many strategies that achieve sufficiently good performance. Bottom: Studying the relationships between strategies could provide insights into behavioral variability across animals and tasks. (B) General task setup: An animal makes inferences about hidden properties of the environment to guide its actions. (C) Specific task setup: An animal searches for food at two harbors whose reward probabilities change over time. (D) The optimal unconstrained strategy consists of an optimal policy coupled to an ideal Bayesian observer. (E) We formulate a constrained strategy as a small program that uses a limited number of internal states to select actions based on past actions and observations. (F) Each program generates action sequences depending on the outcomes of past actions. (G) The optimal unconstrained strategy (D) can be translated into a small program by discretizing the belief update implemented by the ideal Bayesian observer and coupling it to the optimal behavior policy. Top: Optimal belief update. Middle: Belief values ​​can be partitioned into discrete states (filled circles) characterized by the action they indicate (blue versus green). Belief update indicates transitions between states depending on whether a reward was received (solid versus dashed arrows). Bottom: States and transitions represented as a Bayesian program. (H) Top: A 30-state program approximates the Bayesian update in (G) and has two directions of integration that can be interpreted as increasing confidence in both options. Bottom: The two-state Bayesian program, Win-Stay, Lose-Go (WSLG), continues to perform the same action upon a win (i.e., receiving a reward) and switches action upon a loss (i.e., receiving a reward). (I) Example behavior generated by the 30-state Bayes program in (H). Source: Scientific advances (2024). DOI: 10.1126/sciadv.adj4064

When neuroscientists think about the strategy an animal might use to complete a task—such as finding food, hunting prey, or navigating a maze—they often propose a single model that describes the best way the animal can accomplish that task.

Yet in the real world, animals – and humans – may not take the optimal path, which can be resource-intensive. Instead, they use a strategy that is good enough to get the job done but requires much less brain power.

In a new study published in Scientific advancesJanelia scientists wanted to better understand the possible ways an animal can successfully solve a problem, rather than just choosing the best strategy.

The work shows that there are a variety of ways an animal can accomplish a simple foraging task. It also lays out a theoretical framework for understanding these different strategies, how they relate to each other, and how they solve the same problem in different ways.

The researchers found that some of these imperfect ways of accomplishing a task work almost as well as the optimal strategy, but require significantly less effort, giving the animals more time to devote valuable resources to completing multiple tasks.

“Once you let go of the drive for perfection, you’ll be surprised at how many ways there are to solve a problem,” says Tzuhsuan Ma, a postdoc in the Hermundstad Lab who led the research.

The new concept could help researchers study these “good enough” strategies, including why different people use different strategies, how these strategies work together, and how generalizable the strategies are to other tasks. This could help explain how the brain enables behavior in the real world.

“We could never have imagined many of these strategies as possible solutions to this problem, but they work well, so it’s quite possible that animals use them too,” says Janelia group leader Ann Hermundstad. “They give us a new vocabulary for understanding behavior.”

Looking beyond perfection

The research began three years ago when Ma started thinking about the different strategies an animal might use to accomplish a simple but mundane task: choosing between two options where the chance of receiving a reward changes over time.

The researchers wanted to study a group of strategies that lie between optimal and completely random solutions: “small programs” that have limited resources but still get the job done. Each program specifies a different algorithm to guide an animal’s actions based on previous observations, so it can serve as a model of animal behavior.

As it turns out, there are many such programs – about a quarter of a million. To understand these strategies, the researchers first looked at a handful of the best performing ones. Surprisingly, they found that they essentially did the same thing as the optimal strategy, although they used fewer resources.

“We were a little disappointed,” says Ma. “We spent so much time looking for these little programs, and they all follow the same calculation that the field could already derive mathematically without all this effort.”

But the researchers were motivated to keep looking—they had a strong intuition that there had to be programs that were good but deviated from the optimal strategy. When they looked beyond the very best programs, they found what they were looking for: about 4,000 programs that fell into that “good enough” category. And more importantly, more than 90% of them did something new.

They could have stopped there, but a question from another Janelian spurred them on: How could they figure out what strategy an animal was using?

This question led the team to look closely at the behavior of individual programs and develop a systematic approach to thinking about the entire collection of strategies. First, they developed a mathematical method to describe the relationships of the programs to each other through a network that connected the different programs. Next, they examined the behavior described by the strategies and developed an algorithm to show how one of these “good enough” programs could evolve from another.

They found that small changes to the optimal program can lead to large changes in behavior without affecting performance. If some of these new behaviors are also useful in other tasks, it suggests that the same program might be good enough to solve a range of different problems.

“If you consider that an animal is not a specialist optimized to solve just one problem, but rather a generalist that solves many problems, then this is really a new way to study it,” says Ma.

The new work provides researchers with a framework to think beyond single, optimal programs for animal behavior. Now the team is focused on studying how generalizable the small programs are to other tasks and designing new experiments to figure out what program an animal might use to perform a task in real time. They are also collaborating with other researchers at Janelia to test their theoretical framework.

“Ultimately, a good understanding of an animal’s behavior is an essential prerequisite for understanding how the brain solves different types of problems, including some that our best artificial systems solve inefficiently or not at all,” says Hermundstad. “The biggest challenge is that animals may use very different strategies than we initially assume, and this work helps us uncover this space of possibilities.”

More information:
Tzuhsuan Ma et al, A vast space of compact strategies for effective decisions, Scientific advances (2024). DOI: 10.1126/sciadv.adj4064

Information about the magazine:
Scientific advances

Leave a Comment

Your email address will not be published. Required fields are marked *

Scroll to Top