<?xml version="1.0" encoding="UTF-8"?><rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Kevin Niechen</title><description>Kevin Niechen is an engineer and avid reader.</description><link>https://kevinniechen.com/</link><item><title>Tech is a Default Career</title><link>https://kevinniechen.com/default-career/</link><guid isPermaLink="true">https://kevinniechen.com/default-career/</guid><pubDate>Wed, 11 Oct 2023 00:00:00 GMT</pubDate><content:encoded>&lt;p&gt;Tech has become a default career for many young college students. There has never been a career path that has been so high-paying, comfortable, and accessible&lt;sup class=&quot;footnote-ref&quot;&gt;&lt;a href=&quot;#fn1&quot; id=&quot;fnref1&quot;&gt;[1]&lt;/a&gt;&lt;/sup&gt;. Few students decide to major in Computer Science in the same way that someone might decide to major in Physics or Art History.&lt;/p&gt;
&lt;p&gt;What this means is that millions of students today now choose a default, “obviously-right” career without ever going through the painstaking process of figuring out what aligns with their core interests. These students never undergo the existential process of thinking through different paths and asking &apos;what if.&lt;sup class=&quot;footnote-ref&quot;&gt;&lt;a href=&quot;#fn2&quot; id=&quot;fnref2&quot;&gt;[2]&lt;/a&gt;&lt;/sup&gt;&apos;&lt;/p&gt;
&lt;p&gt;Failing to introspect during these pivotal moments has consequences. Choosing a career is one of the first major decisions that young people have to make during their transition to adulthood. Missing out on that pain-filled process means missing out on a chance to learn about personal life principles and how to navigate life to follow those principles. Default careers lead to default relationships, default friendships, default hobbies, and a default life.&lt;/p&gt;
&lt;p&gt;In the beginning, the chase of the next promotion is enough to numb the missing feeling of self-actualization. But at some point, ascending the corporate ladder loses its novelty or becomes too hard to achieve, and the resulting emptiness is enough for some to escape their default existence.&lt;/p&gt;
&lt;p&gt;Others remain, teetering on the edge of pain and comfort throughout their lives. The longer you linger in the wake of a default decision, the more entwined it becomes with your identity - and the harder it becomes for you to leave. The people around you pressure you to stay exactly as you are (external compartmentalization). Your choice of career, city, hobbies, and relationships all become tied up, making it impossible to change one without changing all of the others and completely disrupting your identity.&lt;/p&gt;
&lt;p&gt;In post-grad hubs like San Francisco, this angst permeates the air. The desire to escape the default life is so strong that when someone mentions a job that is even slightly out of the ordinary, people perk up to pay attention.&lt;/p&gt;
&lt;p&gt;Some even go so far as to conflate uniqueness with sincere pursuit, chasing uniqueness for its own sake. They spend more time talking about their pursuits than actually doing them.&lt;/p&gt;
&lt;p&gt;My point isn&apos;t to recklessly abandon the path you&apos;re on but to start thinking deliberately about your life decisions - at least, the ones that matter. The longer you delay, the more structures you&apos;ll build around a life that you didn&apos;t even consciously choose.&lt;/p&gt;
&lt;hr class=&quot;footnotes-sep&quot; /&gt;
&lt;section class=&quot;footnotes&quot;&gt;
&lt;ol class=&quot;footnotes-list&quot;&gt;
&lt;li id=&quot;fn1&quot; class=&quot;footnote-item&quot;&gt;&lt;p&gt;&quot;High finance&quot; and consulting have been default careers for those at coastal elite institutions for a while (and many parallels apply). But tech is a default career for far more students. &lt;a href=&quot;#fnref1&quot; class=&quot;footnote-backref&quot;&gt;↩︎&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li id=&quot;fn2&quot; class=&quot;footnote-item&quot;&gt;&lt;p&gt;Some students do not have the luxury of choice and their optimization function is simply: pick the highest-paying job I can find in order to support my family, pay back loans, etc. These students are not the audience for this post. &lt;a href=&quot;#fnref2&quot; class=&quot;footnote-backref&quot;&gt;↩︎&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;/ol&gt;
&lt;/section&gt;
</content:encoded></item><item><title>Scaling Laws Aren&apos;t as Predictive as You Think</title><link>https://kevinniechen.com/scaling-laws-arent-predictive/</link><guid isPermaLink="true">https://kevinniechen.com/scaling-laws-arent-predictive/</guid><description>Why predicting capabilities from scaling laws is harder than it looks</description><pubDate>Wed, 27 Nov 2024 00:00:00 GMT</pubDate><content:encoded>&lt;p&gt;Scaling compute and data reliably drives down next-token prediction loss. This relationship is well-established and almost physics-like in its predictability.&lt;/p&gt;
&lt;p&gt;However, mapping that mathematically predictable loss to real-world capabilities is far noisier. Most scaling laws tell us how well a model will predict the next word — not whether it can write exploit code, synthesize a novel protein, or pass a bar exam. The relationship between loss and these real-world capabilities is poorly understood, highly task-dependent, and subjective in its modeling.&lt;/p&gt;
&lt;p&gt;Because we can’t cleanly predict capabilities from loss, we need an empirical science of AI evaluations. In this post, I’ll walk through some naive attempts at chaining scaling laws to predict real-world performance, and show why these predictions are far less reliable than many claim.&lt;/p&gt;
&lt;h2&gt;Scaling laws aren’t as predictive as you think&lt;/h2&gt;
&lt;p&gt;Many claim that if you look at these scaling laws and extrapolate, it’s clear that we’ll see massive gains by simply scaling up existing models. Scaling laws are quantitative relationships that relate model inputs (data and compute) to model outputs (how well the model predicts the next word). They’re created by plotting model inputs and outputs at various levels on a graph.&lt;/p&gt;
&lt;p&gt;But using scaling laws to make predictions isn’t as easy as people claim. To begin with, most scaling laws (Kaplan et al, Chinchilla, and Llama) output how well models predict the next word in a dataset, not how well models perform at real-world tasks. This &lt;a href=&quot;https://www.jasonwei.net/blog/common-arguments-regarding-emergent-abilities&quot;&gt;2023 blog post&lt;/a&gt; by a popular OpenAI researcher describes how “it&apos;s currently an open question if surrogate metrics [like loss] could predict emergence ... but this relationship has not been well-studied enough …”&lt;/p&gt;
&lt;h2&gt;Chaining two approximations together to make predictions&lt;/h2&gt;
&lt;p&gt;To fix the above issue, you can fit a second scaling law that quantitatively relates upstream loss to real-world task performance, and then chain the two scaling laws together to make predictions of real-world tasks.&lt;/p&gt;
&lt;pre&gt;&lt;code&gt;Loss = f(data, compute)
Real world task performance = g(loss)
Real world task performance = g(f(data, compute))
&lt;/code&gt;&lt;/pre&gt;
&lt;p&gt;In 2024, Gadre et al and Dubet et al introduced scaling laws of that sort. Dubet uses this method of chained laws for prediction and claims that its predictive ability &quot;extrapolates [well] over four orders of magnitude&quot; for the Llama 3 models.&lt;/p&gt;
&lt;p&gt;However, work on these second scaling laws is nascent, and with so few data points, choosing a fitting function becomes a highly subjective judgment call. For example, in the figures below, Gadre assumes an exponential relationship across an average of many tasks (top) across many tasks, and Dubet assumes a sigmoidal relationship for a single task (bottom) for the ARC-AGI task. These scaling laws are also highly task-dependent (see Mosaic).&lt;/p&gt;
&lt;p&gt;Without a strong hypothesis for the relationship between loss and real-world task accuracy, we don&apos;t have a strong hypothesis for the capabilities of future models.&lt;/p&gt;
&lt;p&gt;&lt;img src=&quot;https://kevinniechen.com/agi-1.avif&quot; alt=&quot;Scaling laws relationship graph&quot; /&gt;&lt;/p&gt;
&lt;h2&gt;A shoddy attempt at using chained scaling laws for predictions&lt;/h2&gt;
&lt;p&gt;What would happen if we were to use some of these naively chained scaling laws to perform predictions anyways? Note the goal here is to show how one can use some set of scaling laws (Gadre) to obtain a prediction, rather than obtain a detailed prediction itself.&lt;sup class=&quot;footnote-ref&quot;&gt;&lt;a href=&quot;#fn1&quot; id=&quot;fnref1&quot;&gt;[1]&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;
&lt;p&gt;To start, we can use publicly available information to estimate the data and compute inputs&lt;sup class=&quot;footnote-ref&quot;&gt;&lt;a href=&quot;#fn2&quot; id=&quot;fnref2&quot;&gt;[2]&lt;/a&gt;&lt;/sup&gt; for the next few model releases. We can take announcements of the largest data center build-outs, estimate the expected resulting compute based on their GPU capacity, and map them onto each successive model generation.&lt;sup class=&quot;footnote-ref&quot;&gt;&lt;a href=&quot;#fn3&quot; id=&quot;fnref3&quot;&gt;[3]&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;
&lt;p&gt;Then, we can use scaling laws to estimate the amount of data these clusters would need. The largest cluster estimate from the Institute for Progress would ideally train on 770T tokens to minimize loss according to the scaling laws we&apos;re using—a few times larger than the size of the indexed web.&lt;sup class=&quot;footnote-ref&quot;&gt;&lt;a href=&quot;#fn4&quot; id=&quot;fnref4&quot;&gt;[4]&lt;/a&gt;&lt;/sup&gt; That seems challenging but feasible, so let&apos;s just use that for now.&lt;/p&gt;
&lt;p&gt;&lt;img src=&quot;https://kevinniechen.com/agi-2.avif&quot; alt=&quot;Data and compute estimates graph&quot; /&gt;
&lt;em&gt;See link to &lt;a href=&quot;https://docs.google.com/spreadsheets/u/1/d/1XjrzKYbHgCbdWfYy9tmt0v2BxzdB-9zqrgxacHqH6p0/edit?gid=0#gid=0&quot;&gt;Google Sheet&lt;/a&gt; of data and compute estimates&lt;/em&gt;&lt;sup class=&quot;footnote-ref&quot;&gt;&lt;a href=&quot;#fn5&quot; id=&quot;fnref5&quot;&gt;[5]&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;
&lt;p&gt;Finally, we can plug these inputs into chained scaling laws and extrapolate. The right plot is what we&apos;re interested in. It shows real-world task performance on the vertical axis, plotted against the inputs of data and compute on the horizontal axes. Blue points represent performance on existing models (GPT-2, GPT-3, etc), while red points are projections for the next scale-ups (GPT-5, GPT-6, GPT-7, etc):&lt;/p&gt;
&lt;p&gt;&lt;img src=&quot;https://kevinniechen.com/agi-3.avif&quot; alt=&quot;Chained scaling laws results&quot; /&gt;
&lt;em&gt;See link to &lt;a href=&quot;https://www.google.com/url?q=https://github.com/kevinniechen/scalinglaws&amp;amp;sa=D&amp;amp;source=docs&amp;amp;ust=1732587136979424&amp;amp;usg=AOvVaw1jSlr0jEP17e2OE1gnHMVC&quot;&gt;Github&lt;/a&gt; repository for chained Gadre scaling laws and resulting plots&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;Using these scaling laws, the predicted improvement in real-world tasks from GPT-4 to a GPT-7 style model (~25000X more compute) would be around the same magnitude as the improvement from GPT-3 to GPT-4 (~100X more compute). But the takeaway isn&apos;t that scaling has hit a wall — it&apos;s that these public, naive scaling laws fail to capture reality. They&apos;re fit on open datasets and small models, and don&apos;t account for frontier lab advantages: algorithmic efficiency gains, synthetic data, RLHF, and other post-training techniques. The predicted stagnation likely reflects the limits of public visibility into frontier scaling, not the limits of scaling itself.&lt;/p&gt;
&lt;h2&gt;Are we getting close to the irreducible loss?&lt;/h2&gt;
&lt;p&gt;If you look at the left plot, these scaling laws suggest we&apos;re approaching the irreducible loss on this particular dataset.&lt;sup class=&quot;footnote-ref&quot;&gt;&lt;a href=&quot;#fn6&quot; id=&quot;fnref6&quot;&gt;[6]&lt;/a&gt;&lt;/sup&gt; The irreducible loss is closely related to the entropy of the dataset, and represents the theoretical best performance a model can reach on that dataset. With Gadre scaling laws on RedPajama, the best possible model can only reach an irreducible loss of ~1.84, and GPT-4 is already estimated at ~2.05.&lt;sup class=&quot;footnote-ref&quot;&gt;&lt;a href=&quot;#fn7&quot; id=&quot;fnref7&quot;&gt;[7]&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;
&lt;p&gt;&lt;img src=&quot;https://kevinniechen.com/agi-4.avif&quot; alt=&quot;Gadre et al, table 6&quot; /&gt;&lt;/p&gt;
&lt;p&gt;But this is the irreducible loss for one dataset under one set of scaling laws. Frontier labs train on different data mixtures, use synthetic data, and apply post-training techniques that these public scaling laws don&apos;t capture. Most labs have also stopped releasing loss values for their frontier training runs, so we don&apos;t actually know how close they are to any irreducible loss — or whether the relevant loss landscape looks anything like this one.&lt;/p&gt;
&lt;h2&gt;Subjectivity in fitting functions and the limits of our data&lt;/h2&gt;
&lt;p&gt;As mentioned previously, the choice of fitting function on the second scaling law is highly subjective. For example, we could refit the loss and performance points from the Gadre paper using a sigmoidal function instead of an exponential one:&lt;/p&gt;
&lt;p&gt;&lt;img src=&quot;https://kevinniechen.com/agi-5.avif&quot; alt=&quot;Custom sigmoidal function on Gadre&apos;s data points&quot; /&gt;
&lt;em&gt;See link to &lt;a href=&quot;https://www.google.com/url?q=https://github.com/kevinniechen/scalinglaws&amp;amp;sa=D&amp;amp;source=docs&amp;amp;ust=1732587136979424&amp;amp;usg=AOvVaw1jSlr0jEP17e2OE1gnHMVC&quot;&gt;Github&lt;/a&gt; repository for sigmoidal fit on Gadre data and resulting plots&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;Yet, the conclusion remains largely unchanged. Comparing the exponential fit (red line) with our custom sigmoidal fit (dotted purple line) in the left graph, the limitation is clear: we simply don’t have enough data points to confidently determine the best fitting function for relating loss to real-world performance.&lt;/p&gt;
&lt;h2&gt;No one actually knows how strong the next models will be&lt;/h2&gt;
&lt;p&gt;There are obviously many ways to improve the above &quot;prediction&quot;: using better scaling laws, using better estimates of data and compute, and so on.&lt;sup class=&quot;footnote-ref&quot;&gt;&lt;a href=&quot;#fn8&quot; id=&quot;fnref8&quot;&gt;[8]&lt;/a&gt;&lt;/sup&gt; The point of the above exercise is more to show the amount of uncertainty baked into these predictions than to perform an accurate prediction.&lt;/p&gt;
&lt;p&gt;Ultimately, scaling laws are noisy approximations, and with this chained method of prediction, we&apos;re coupling two noisy approximations together. When you consider that the next models may have entirely different scaling laws, as a result of different architectures or data mixes, no one really knows the capabilities of the next few model scale-ups.&lt;/p&gt;
&lt;h2&gt;We need empirical evaluations, not extrapolations&lt;/h2&gt;
&lt;p&gt;Extrapolating scaling laws is far less straightforward than many claim. The first scaling law — loss as a function of data and compute — is relatively predictable. But the second — real-world capabilities as a function of loss — is subjective, noisy, and poorly constrained by data.&lt;/p&gt;
&lt;p&gt;This means we cannot predict exactly when specific capabilities will emerge just by looking at a loss curve. We can’t look at a scaling law and say &quot;at this many FLOPs, the model will be able to conduct autonomous cyber-offense&quot; or &quot;at this loss level, it will be able to synthesize novel pathogens.&quot; The mapping from loss to dangerous capabilities is too noisy for that kind of precision.&lt;/p&gt;
&lt;p&gt;What we need instead is an empirical science of AI evaluations — rigorous, task-specific benchmarks that directly measure the capabilities we care about, rather than relying on extrapolations from surrogate metrics.&lt;/p&gt;
&lt;p&gt;&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;
&lt;em&gt;Thank you to Celine, Matthew, Jasmine, Coen, Shreyan, Nikhil, Trevor, Namanh, and Gabe for their invaluable feedback; Justin for his help with scaling laws; and Bela, Susan, and Maxwell for &apos;encouragement.&apos;&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;&lt;em&gt;November 30, 2024 update: I changed the data and compute estimates to IFP estimates after Miles&apos; &lt;a href=&quot;https://x.com/Miles_Brundage/status/1862287225381179794&quot;&gt;note&lt;/a&gt; instead of using my own compute estimates&lt;/em&gt;.&lt;/p&gt;
&lt;p&gt;&lt;em&gt;Title update: this post was originally titled &quot;Will We Have AGI?&quot; The framing felt outdated, so I renamed it to &quot;Scaling Laws Aren&apos;t as Predictive as You Think,&quot; which better reflects the actual content.&lt;/em&gt;&lt;/p&gt;
&lt;hr class=&quot;footnotes-sep&quot; /&gt;
&lt;section class=&quot;footnotes&quot;&gt;
&lt;ol class=&quot;footnotes-list&quot;&gt;
&lt;li id=&quot;fn1&quot; class=&quot;footnote-item&quot;&gt;&lt;p&gt;There are many potential issues with this approach, including the choice of tasks, the assumed function for modeling loss to error, the number of data points used for the fit, not considering the different quality of training tokens etc. &lt;a href=&quot;#fnref1&quot; class=&quot;footnote-backref&quot;&gt;↩︎&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li id=&quot;fn2&quot; class=&quot;footnote-item&quot;&gt;&lt;p&gt;&lt;em&gt;“I disagree with your methods on predicting the inputs (data and compute) for the next few model releases. You’re massively underestimating or overestimating the compute we’ll get from data center build-outs, distributed training, and GPU improvements, as well as the data we’ll get from leveraging multi-modal data and synthetic data. Why don’t you replot with those considerations?”&lt;/em&gt; With Gadre’s scaling laws, the predicted performance stagnates regardless — but this likely reflects limitations of these particular public scaling laws rather than a fundamental ceiling. &lt;a href=&quot;#fnref2&quot; class=&quot;footnote-backref&quot;&gt;↩︎&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li id=&quot;fn3&quot; class=&quot;footnote-item&quot;&gt;&lt;p&gt;Notably, we’re not taking into account potential advances such as cross-data center training &lt;a href=&quot;#fnref3&quot; class=&quot;footnote-backref&quot;&gt;↩︎&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li id=&quot;fn4&quot; class=&quot;footnote-item&quot;&gt;&lt;p&gt;I’m using the simplifying assumption that total GPU flops = effective FLOPs (which is an overestimate because clusters will incur communication overhead) &lt;a href=&quot;#fnref4&quot; class=&quot;footnote-backref&quot;&gt;↩︎&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li id=&quot;fn5&quot; class=&quot;footnote-item&quot;&gt;&lt;p&gt;I don’t include Llama-400B model in later graphs but include it here for the sake of comparison to GPT-4 input estimates &lt;a href=&quot;#fnref5&quot; class=&quot;footnote-backref&quot;&gt;↩︎&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li id=&quot;fn6&quot; class=&quot;footnote-item&quot;&gt;&lt;p&gt;&lt;em&gt;“I don&apos;t understand the irreducible error in Gadre’s scaling laws. Why is the irreducible loss for the C4 dataset lower than the irreducible loss for the RedPajama dataset, when the C4 dataset is a subset of the RedPajama dataset?”&lt;/em&gt; Scaling laws fit on a small number of data points are rough approximations. As mentioned above, I think the method we have has several issues, and my larger point is that publicly available scaling laws aren&apos;t trustworthy for predictions multiple orders of magnitude away from their fitted points. &lt;a href=&quot;#fnref6&quot; class=&quot;footnote-backref&quot;&gt;↩︎&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li id=&quot;fn7&quot; class=&quot;footnote-item&quot;&gt;&lt;p&gt;It’s possible that the last few gains in loss will lead to extraordinary outcomes (e.g being able to predict every single word is very different than being able to predict 99% of words) but this relates to the point of us not really knowing how to model the relationship between loss and capabilities in a generic way &lt;a href=&quot;#fnref7&quot; class=&quot;footnote-backref&quot;&gt;↩︎&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li id=&quot;fn8&quot; class=&quot;footnote-item&quot;&gt;&lt;p&gt;Potential blog: What should you do if you believe in AGI? &lt;a href=&quot;#fnref8&quot; class=&quot;footnote-backref&quot;&gt;↩︎&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;/ol&gt;
&lt;/section&gt;
</content:encoded></item><item><title>Self Narratives</title><link>https://kevinniechen.com/self-narrative/</link><guid isPermaLink="true">https://kevinniechen.com/self-narrative/</guid><pubDate>Thu, 19 Oct 2023 00:00:00 GMT</pubDate><content:encoded>&lt;p&gt;People often invent stories about themselves to feel more interesting or deflect blame.&lt;/p&gt;
&lt;p&gt;These narratives usually take the form: &quot;I am the type of person that needs X because I have Y unique character trait.&quot;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&quot;I&apos;m the type of person who needs $5M before pursuing my dreams, because I need to feel complete freedom to work with maximum creativity&quot;&lt;/li&gt;
&lt;li&gt;&quot;I&apos;m the kind of person who needs to like my girlfriend more than she likes me, because I need the endorphins of the &quot;chase&quot; to consistently spend time with someone&quot;&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;People come up with absurdities about themselves because they want to be entertaining, and absurdity is one way there. Even if they don&apos;t initially believe their stories, they psy-op themselves a bit more with every retelling, eventually becoming flanderized versions of their original selves.&lt;/p&gt;
&lt;p&gt;Our lives are filled with these kinds of fictions from an early age. Through icebreakers, we&apos;re taught to tell special, exaggerated details about ourselves. Through television, we&apos;re exposed to quirk-packed protagonists designed to keep us entertained over hundreds of episodes&lt;sup class=&quot;footnote-ref&quot;&gt;&lt;a href=&quot;#fn1&quot; id=&quot;fnref1&quot;&gt;[1]&lt;/a&gt;&lt;/sup&gt;.&lt;/p&gt;
&lt;p&gt;Romantics and &quot;intellectuals&quot; are especially susceptible to self narratives. Romantics like envisioning themselves as the protagonist of some interesting story. They would prefer to be a piece of some grand tragedy than settle for a straightforward life. Intellectuals enjoy reading into nebulous data points to craft theories about their lives and those of others.&lt;/p&gt;
&lt;p&gt;The other reason why these narratives are so alluring is an excuse: they let people blame their failures and decision deferments on supposedly fixed characteristics.&lt;/p&gt;
&lt;p&gt;These excuses obstruct genuine paths to happiness and growth. Think of someone who labels themselves as risk-averse based on a single entertaining anecdote or rationalization of a past missed opportunity. They might say no to a once-in-a-lifetime opportunity, thinking &quot;I&apos;m just not someone that takes risks&quot;.&lt;/p&gt;
&lt;p&gt;The truth is that we&apos;re simpler than the stories we tell ourselves. We all share the same motivations, but our narratives get in the way.&lt;/p&gt;
&lt;hr class=&quot;footnotes-sep&quot; /&gt;
&lt;section class=&quot;footnotes&quot;&gt;
&lt;ol class=&quot;footnotes-list&quot;&gt;
&lt;li id=&quot;fn1&quot; class=&quot;footnote-item&quot;&gt;&lt;p&gt;It&apos;s fine when stories prioritize entertainment over realistic portrayal, but when they present as the latter, they teach their audience wrong models of the world. &lt;a href=&quot;#fnref1&quot; class=&quot;footnote-backref&quot;&gt;↩︎&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;/ol&gt;
&lt;/section&gt;
</content:encoded></item></channel></rss>