{"slug": "the-bitter-lesson-is-the-observation-in-artificial-intelligence", "title": "The bitter lesson is the observation in artificial intelligence", "summary": "Richard Sutton's 2019 essay 'The Bitter Lesson' argues that in artificial intelligence, general approaches that scale with computational power outperform domain-specific methods in the long run, as exemplified by Deep Blue, AlphaGo Zero, and deep learning in speech recognition and computer vision. Sutton concludes that investing in scalable techniques like search and learning is more effective than incorporating human insights.", "body_md": "# Bitter lesson\n\n| Part of\n|\n\n[Artificial intelligence (AI)](https://en.wikipedia.org/wiki/Artificial_intelligence)\n\n[Glossary](https://en.wikipedia.org/wiki/Glossary_of_artificial_intelligence)\nThe **bitter lesson** is the observation in [artificial intelligence](https://en.wikipedia.org/wiki/Artificial_intelligence) that, in the long run, general approaches that [scale](https://en.wikipedia.org/wiki/Scalability) with available computational power tend to outperform ones based on [domain-specific understanding](https://en.wikipedia.org/wiki/Domain_knowledge) because they are better at taking advantage of the falling cost of computation over time. The principle was proposed and named in a 2019 essay by [Richard Sutton](https://en.wikipedia.org/wiki/Richard_S._Sutton) [1] and is now widely accepted.\n\n[[2]](#cite_note-generalist-agent-2)\n\n[[3]](#cite_note-switch-transformers-3)\n\n[[4]](#cite_note-learning-bitter-lesson-4)\n\n[[5]](#cite_note-eng-less-artificial-5)\n\n[[6]](#cite_note-brain-lesson-6)\n\n[[7]](#cite_note-beyond-imitation-game-7)\n\n[[8]](#cite_note-overestimation-overfitting-actor-critic-8)## The essay\n\n[[edit](/w/index.php?title=Bitter_lesson&action=edit§ion=1)]\n\nSutton gives several examples that illustrate the lesson:\n\n[Game playing](https://en.wikipedia.org/wiki/General_game_playing). In[chess](https://en.wikipedia.org/wiki/Chess), the[Deep Blue](https://en.wikipedia.org/wiki/Deep_Blue_(chess_computer))system that became the first[computer opponent](https://en.wikipedia.org/wiki/Computer_chess)to defeat a[world champion](https://en.wikipedia.org/wiki/World_Chess_Championship)relied on a relatively simple[alpha–beta search algorithm](https://en.wikipedia.org/wiki/Alpha–beta_pruning)that scaled up by applying large amounts of specialized hardware to search for the best move. This defeated previous attempts to exploit the unique structure of chess or to include[grandmaster](https://en.wikipedia.org/wiki/Grandmaster_(chess))knowledge directly. Likewise in the game of[Go](https://en.wikipedia.org/wiki/Go_(game)), the[AlphaGo](https://en.wikipedia.org/wiki/AlphaGo)algorithm that surpassed human performance relied much less on expert skill at the game itself than previous generations of AI, and was further surpassed by[AlphaGo Zero](https://en.wikipedia.org/wiki/AlphaGo_Zero), which removed human expertise completely and trained only by[self-play](https://en.wikipedia.org/wiki/Self-play).[Speech recognition](https://en.wikipedia.org/wiki/Speech_recognition). Approaches based on training a general-purpose[hidden Markov model](https://en.wikipedia.org/wiki/Hidden_Markov_model)with large numbers of speech samples consistently outperformed the hand-crafted approaches of the 1970s, and[deep learning](https://en.wikipedia.org/wiki/Deep_learning)has continued this trend.[Computer vision](https://en.wikipedia.org/wiki/Computer_vision). Algorithms that were assumed to approximate the human[visual system](https://en.wikipedia.org/wiki/Visual_system)(such as explicitly encoded[edge detection](https://en.wikipedia.org/wiki/Edge_detection)or detecting high-level features with[SIFT](https://en.wikipedia.org/wiki/Scale-invariant_feature_transform)) were outperformed by[convolutional neural networks](https://en.wikipedia.org/wiki/Convolutional_neural_network)that make far fewer assumptions about the nature of[visual perception](https://en.wikipedia.org/wiki/Visual_perception).\n\nSutton concludes that time is better invested in finding simple scalable solutions that can take advantage of Moore's law, rather than introducing ever-more-complex human insights, and calls this the \"bitter lesson\". He also cites two general-purpose techniques that have been shown to scale effectively: [search](https://en.wikipedia.org/wiki/Search_algorithm) and [learning](https://en.wikipedia.org/wiki/Machine_learning). The lesson is considered \"bitter\" because it is less [anthropocentric](https://en.wikipedia.org/wiki/Anthropocentrism) than many researchers expected and so they have been slow to accept it.\n\n## Impact\n\n[[edit](/w/index.php?title=Bitter_lesson&action=edit§ion=2)]\n\nThe essay was published on Sutton's website incompleteideas.net in 2019, and has received hundreds of formal citations according to [Google Scholar](https://en.wikipedia.org/wiki/Google_Scholar). Some of these provide alternative statements of the principle; for example, the 2022 paper \"A Generalist Agent\" from [Google DeepMind](https://en.wikipedia.org/wiki/Google_DeepMind) summarized the lesson as:[[2]](#cite_note-generalist-agent-2)\n\nHistorically, generic models that are better at leveraging computation have also tended to overtake more specialized domain-specific approaches, eventually.\n\nAnother phrasing of the principle is seen in a Google paper on switch [transformers](https://en.wikipedia.org/wiki/Transformer_(deep_learning_architecture)) coauthored by [Noam Shazeer](https://en.wikipedia.org/wiki/Noam_Shazeer):[[3]](#cite_note-switch-transformers-3)\n\nSimple architectures—backed by a generous computational budget, data set size and parameter count—surpass more complicated algorithms.\n\nThe principle is further referenced in many other works on artificial intelligence. For example, *From Deep Learning to Rational Machines* draws a connection to long-standing debates in the field, such as [Moravec's paradox](https://en.wikipedia.org/wiki/Moravec's_paradox) and the contrast between [neats and scruffies](https://en.wikipedia.org/wiki/Neats_and_scruffies). [9] In \"Engineering a Less Artificial Intelligence\", the authors concur that \"flexible methods so far have always outperformed handcrafted domain knowledge in the long run\" although note that \"[w]ithout the right (implicit) assumptions,\n\n[generalization](https://en.wikipedia.org/wiki/Generalization_(learning))is impossible\".\n\nMore recently, \"The Brain's Bitter Lesson: Scaling Speech Decoding With Self-Supervised Learning\" continues Sutton's argument, contending that (as of 2025) the lesson has not been fully learned in the fields of speech recognition and\n\n[[5]](#cite_note-eng-less-artificial-5)[brain data](https://en.wikipedia.org/wiki/Brain–computer_interface).\n\n[[6]](#cite_note-brain-lesson-6)Other work has looked to apply the principle and validate it in new domains. For example, the 2022 paper \"Beyond the Imitation Game\" applies the principle to [large language models](https://en.wikipedia.org/wiki/Large_language_model) to conclude that \"it is vitally important that we understand their capabilities and limitations\" to \"avoid devoting research resources to problems that are likely to be solved by scale alone\". [7] In 2024, \"Learning the Bitter Lesson: Empirical Evidence from 20 Years of CVPR Proceedings\" looked at further evidence from the field of computer vision and\n\n[pattern recognition](https://en.wikipedia.org/wiki/Pattern_recognition), and concludes that the previous twenty years of experience in the field shows \"a strong adherence to the core principles of the 'bitter lesson'\".\n\nIn \"Overestimation, Overfitting, and Plasticity in Actor-Critic: the Bitter Lesson of Reinforcement Learning\", the authors look at generalization of\n\n[[4]](#cite_note-learning-bitter-lesson-4)[actor-critic algorithms](https://en.wikipedia.org/wiki/Actor-critic_algorithm)and find that \"general methods that are motivated by stabilization of\n\n[gradient-based learning](https://en.wikipedia.org/wiki/Gradient_descent)significantly outperform\n\n[RL](https://en.wikipedia.org/wiki/Reinforcement_learning)-specific algorithmic improvements across a variety of environments\" and note that this is consistent with the bitter lesson.\n\n[[8]](#cite_note-overestimation-overfitting-actor-critic-8)## References\n\n[[edit](/w/index.php?title=Bitter_lesson&action=edit§ion=3)]\n\n[↑](#cite_ref-1)Sutton, Rich (March 13, 2019).[\"The Bitter Lesson\"](http://www.incompleteideas.net/IncIdeas/BitterLesson.html).*www.incompleteideas.net*. Retrieved September 7, 2025.[1](#cite_ref-generalist-agent_2-0)[2](#cite_ref-generalist-agent_2-1)Reed, Scott; Zolna, Konrad; Parisotto, Emilio; et al. (2022).[\"A Generalist Agent\"](https://openreview.net/forum?id=1ikK0kHjvj).*Transactions on Machine Learning Research*(2834–8856).[arXiv](https://en.wikipedia.org/wiki/ArXiv_(identifier)):[2205.06175](https://arxiv.org/abs/2205.06175). Retrieved September 7, 2025.[1](#cite_ref-switch-transformers_3-0)[2](#cite_ref-switch-transformers_3-1)Fedus, William; Zoph, Barret; Shazeer, Noam (2022).[\"Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity\"](http://jmlr.org/papers/v23/21-0998.html).*Journal of Machine Learning Research*.**23**(120): 1–39. Retrieved September 14, 2025.[1](#cite_ref-learning-bitter-lesson_4-0)[2](#cite_ref-learning-bitter-lesson_4-1)Yousefi, Mojtaba; Collins, Jack.[\"Learning the Bitter Lesson: Empirical Evidence from 20 Years of CVPR Proceedings\"](https://aclanthology.org/2024.nlp4science-1.15/).*Proceedings of the 1st Workshop on NLP for Science (NLP4Science)*. Association for Computational Linguistics. pp. 175–187. Retrieved September 7, 2025.[1](#cite_ref-eng-less-artificial_5-0)[2](#cite_ref-eng-less-artificial_5-1)Sinz, Fabian H.; Pitkow, Xaq; Reimer, Jacob; et al. (2019).[\"Engineering a Less Artificial Intelligence\"](https://www.cell.com/neuron/fulltext/S0896-6273(19)30740-8).*Neuron*.**103**(6). Elsevier: 967–979.[doi](https://en.wikipedia.org/wiki/Doi_(identifier)):[10.1016/j.neuron.2019.08.034](https://doi.org/10.1016%2Fj.neuron.2019.08.034). Retrieved September 13, 2025.[1](#cite_ref-brain-lesson_6-0)[2](#cite_ref-brain-lesson_6-1)Jayalath, Dulhan; Landau, Gilad; Shillingford, Brendan; Woolrich, Mark; Parker Jones, ʻŌiwi (2025).[\"The Brain's Bitter Lesson: Scaling Speech Decoding With Self-Supervised Learning\"](https://icml.cc/virtual/2025/poster/44019).*Forty-second International Conference on Machine Learning*. Proceedings of Machine Learning Research. Retrieved September 13, 2025.[1](#cite_ref-beyond-imitation-game_7-0)[2](#cite_ref-beyond-imitation-game_7-1)Srivastava, Aarohi; Rastogi, Abhinav; Rao, Abhishek; Awal, Abu; Abid, Abubakar; et al.[\"Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language models\"](https://arxiv.org/abs/2206.04615).*The Fourteenth International Conference on Learning Representations*.[1](#cite_ref-overestimation-overfitting-actor-critic_8-0)[2](#cite_ref-overestimation-overfitting-actor-critic_8-1)Nauman, Michal; Bortkiewicz, Michał; Miłoś, Piotr; Trzciński, Tomasz; Ostaszewski, Mateusz; et al. (2024).[\"Overestimation, Overfitting, and Plasticity in Actor-Critic: the Bitter Lesson of Reinforcement Learning\"](https://arxiv.org/pdf/2403.00514).*Proceedings of the 41st International Conference on Machine Learning*. Proceedings of Machine Learning Research. Retrieved September 13, 2025.[↑](#cite_ref-9)Buckner, Cameron J. (December 11, 2023).*From Deep Learning to Rational Machines: What the History of Philosophy Can Teach Us about the Future of Artificial Intelligence*. Oxford University Press.[doi](https://en.wikipedia.org/wiki/Doi_(identifier)):[10.1093/oso/9780197653302.001.0001](https://doi.org/10.1093%2Foso%2F9780197653302.001.0001).[ISBN](https://en.wikipedia.org/wiki/ISBN_(identifier))[9780197653302](https://en.wikipedia.org/wiki/Special:BookSources/9780197653302).", "url": "https://wpnews.pro/news/the-bitter-lesson-is-the-observation-in-artificial-intelligence", "canonical_source": "https://en.wikipedia.org/wiki/Bitter_lesson", "published_at": "2026-08-17 22:22:28+00:00", "updated_at": "2026-08-17 22:41:13.543759+00:00", "lang": "en", "topics": ["artificial-intelligence", "ai-research"], "entities": ["Richard Sutton", "Deep Blue", "AlphaGo Zero", "AlphaGo"], "alternates": {"html": "https://wpnews.pro/news/the-bitter-lesson-is-the-observation-in-artificial-intelligence", "markdown": "https://wpnews.pro/news/the-bitter-lesson-is-the-observation-in-artificial-intelligence.md", "text": "https://wpnews.pro/news/the-bitter-lesson-is-the-observation-in-artificial-intelligence.txt", "jsonld": "https://wpnews.pro/news/the-bitter-lesson-is-the-observation-in-artificial-intelligence.jsonld"}}