Pith. sign in

REVIEW 1 major objections 6 minor 144 references

Algorithmic Approaches to Sequential Decision-Making and Social Epistemology

T0 review · 1 major / 6 minor · reviewed 2026-08-01 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This thesis proves no randomized algorithm for improving multi-armed bandits can beat an Ω(√k) approximation factor, then matches it up to a log with a simple threshold rule and extends to data-driven tuning and social models.

desk verdict A solid thesis that repackages four peer-reviewed IMAB papers; the new material is an honest philosophical essay, and the main soft spot is a repairable counting bug in the data-driven sample-complexity proof. read the letter →

arxiv 2607.20636 v1 pith:DPJFXL5I submitted 2026-07-22 cs.DS cs.LG

Kavya Ravichandran This is my paper · ORCID
classification cs.DScs.LG MSC 68W2068W2791A2662L05
keywords improvingmulti-armedbanditscompetitiveratiodiminishingreturnsdata-drivenalgorithmdesignsamplecomplexitybest-armidentificationpessimismtrapsgrit
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The thesis asks how a decision-maker should allocate effort among options whose reward grows with investment, in the worst case and when similar historical instances are available. It establishes that in the general improving multi-armed bandits problem, no randomized algorithm can approximate the optimal cumulative reward better than a factor of Ω(√k), and it gives a simple 'play until it can no longer be best, then discard' algorithm that attains O(√k log k) using only an estimate of the best option's final value. With polynomially many past instances, empirical risk minimization over a one-parameter family of algorithms is near-optimal in expectation. In the social half, the thesis provides a formal model of pessimism traps and proves a time-varying subsidy can shift communities out of them permanently, and models grit as optimism or discomfort tolerance.

What carries the argument

The central object in Part I is the 'power-thresholded round robin' (PTRR_α), the family of algorithms that pulls an arm only while f_i(t_i) ≥ m (t_i/τ)^α, where m estimates the best arm's final reward and τ is an internal horizon. The α parameter measures the strength of concavity assumed: α=1 is a linear threshold and recovers the √k worst-case algorithm; α<1 exploits the condition that every arm lies above a power lower envelope to improve the competitive ratio to k^{α/(α+1)}. In Part II, the carrying mechanism is a sequential social-learning cascade: each agent chooses an ambitious or modest option based on predecessors' actions and a private signal, and pessimism traps form when modest

What would settle it

Take the lower-bound family with one arm rising linearly and k-1 arms flattening after T/√k pulls; if any randomized algorithm achieves a worst-case competitive ratio o(√k) on that family, the central lower bound is false. For the social claim, implement the time-varying subsidy in a cascade experiment with human or simulated agents: if communities return to the pessimistic equilibrium after the subsidy is withdrawn, the sustainability claim fails.

Watch

Extended reading notes

Core claim

At the heart of the technical half is a sharpening of the worst-case view of improving bandits: even with randomization, the best achievable approximation factor is Θ̃(√k). The lower bound comes from a distribution where a single arm rises linearly while all others flatten after T/√k pulls; the upper bound is a randomized round-robin that keeps an arm only while its observed reward stays above a line from the origin to its estimated final value. The same threshold rule, generalized to a power curve with exponent α, interpolates between the √k worst-case and better guarantees when reward curves are more concave; a matching lower bound shows the exponent is optimal. The thesis then proves that

Load-bearing premise

The load-bearing premise is that human decision-makers are rational Bayesian expected-utility maximizers; the thesis itself concedes (Section 5.1.4) that this defines the procedure agents are assumed to follow and makes it harder to judge real-world relevance.

Editorial extensions

If this is right

  • For any deployment of improving bandits where rewards are concave and the horizon is finite, the √k bound is the right benchmark: no amount of clever randomization can do better in the worst case, and the threshold algorithm is within a log factor.
  • If a practitioner has historical learning curves or similar past instances, they need only polynomially many samples—roughly (H/ε)^2 log(kT/δ)—to tune the curvature parameter and the switch time; the tuned algorithm is near-optimal in expectation.
  • On instances whose reward curves are more concave than linear (satisfying a β-power lower envelope), the PTRR family strictly improves the competitive ratio to k^{β/(β+1)}, with a matching lower bound showing this exponent is the best possible.
  • Best-arm identification can be made robust: a hybrid algorithm commits to the best arm exactly when a gap-clearance condition holds within the budget, and otherwise returns an arm whose final reward is within a k^{α/(α+1)} factor of the best arm.
  • In the social model, carefully designed time-varying subsidies can permanently move communities out of pessimism traps, and grit, formalized as optimism or discomfort tolerance, changes when a rational agent abandons an ambitious goal.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The threshold-rule view suggests a simple, testable design principle for human 'singular evaluation': an agent who discards an option as soon as evidence rules it out is nearly optimal at the scale of the number of options, even without knowing the best option's true value; this could be probed in behavioral experiments by measuring whether people's thresholds approximate a downward-sloping line.
  • The data-driven sample-complexity bound implies that for any domain with stationary learning curves, an organization can amortize the cost of tuning over repeated deployments, because the number of historical instances needed grows only polynomially in desired accuracy and logarithmically in the horizon and number of options.
  • The pessimism-trap result suggests a testable policy prediction: a time-limited subsidy that is randomly varied across communities should produce lasting divergence between treated and untreated communities even after the subsidy ends, whereas a fixed subsidy would need to be permanent. This contrast could be checked in field experiments or with quasi-experimental variation.
  • If grit is optimism or discomfort tolerance, then policies that seed optimism are substitutes for financial support; the thesis's models imply the two levers have different comparative statics, for instance that grit helps most when the true threshold is moderate, which is a prediction about when mentorship versus cash is more effective.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 6 minor

Summary. The thesis studies sequential decision-making and social epistemology around the common theme of choosing whether to persist or give up. Part I addresses the improving multi-armed bandits (IMAB) problem. Chapter 3 gives a worst-case Yao lower bound of Ω(√k) on the approximation factor of any randomized algorithm and an O(√k log k) upper bound via a randomized round-robin algorithm whose analysis is based on a checkable recurrence. Chapter 4 moves to the data-driven algorithm design framework: it introduces a one-parameter family PTRR_α, proves sharper competitive ratios depending on a concavity-envelope exponent β, claims sample-complexity bounds for tuning α, and proposes a two-stage hybrid family for best-arm identification with best-of-both-worlds guarantees. Part II contains a philosophical chapter on the roles of theoretical models, followed by models of pessimism traps with time-varying financial subsidies and a formal treatment of grit as optimism or discomfort tolerance. The manuscript is a thesis-style compilation of several conference papers, with Chapter 5 newly written.

Significance. If the results hold, the thesis makes solid contributions: the worst-case IMAB bounds are nearly tight and improve on the deterministic Θ(k) result; the β-dependent competitive ratios are a natural and useful refinement; and the data-driven framework is a reasonable route beyond worst-case analysis. The empirical study on LCDB learning curves is a welcome addition, even though the differences across α are modest for most datasets. The Part II models are more interpretive, but the thesis is unusually candid about their limitations—especially the rational-agent idealization flagged in Section 5.1.4—which is a genuine strength. The main technical concern is in the sample-complexity analysis of Chapter 4, where a counting argument is incorrect as written.

major comments (1)
  1. [§4.3.3, Lemma 4.3.3 and §4.4.3, Lemma 4.4.2] The proof of Lemma 4.3.3 counts the tuple R_α = (t_stop^(1), ..., t_stop^(k)) as having at most kT possible values because each coordinate takes one of T values. The Cartesian product has T^k values, not kT, so the asserted bound Q_D ≤ kT is not established by the written argument. Consequently, Theorem 4.3.4's bound O((H/ε)^2(log kT + log(1/δ))) does not follow. The same flaw appears in Lemma 4.4.2, where Q_D ≤ kT^2 is asserted for the two-parameter hybrid family. The bound is likely salvageable: for a fixed derandomized instance, each t_stop^(j) is monotone in α, so the set of tuples visited lies on a monotone path with at most O(kT) distinct points; but that argument is not present. If the product bound T^k is used instead, the sample complexity becomes O((H/ε)^2(k log T + log(1/δ))), which is still polynomial but changes the stated logarithmic dependence. This is load-bearing for the
minor comments (6)
  1. [§3.2, proof of Theorem 3.2.1] The displayed expression bounding the reward under event E^c is garbled and does not parse to the claimed T/k + T/√k − T/k. It should be the sum over the triangular reward of a suboptimal arm, e.g. sum_{t=1}^{T/√k} t/T + (T − T/√k)/√k. The final bound is still recoverable, but the equation needs rewriting.
  2. [§2.3, Table 2.1] The row for [HKR16] says 'sublinear as T→0'; this should presumably read 'as T→∞'.
  3. [§4.4.3, Lemma 4.4.2] The lemma is stated for 'the family B defined in Defn. 4.3.1', but it concerns the hybrid family Hybrid from Definition 4.4.1. Please correct the cross-reference.
  4. [Algorithms 1 and 4] Algorithm 1 uses a strict inequality 'f_i(t_i) > m t_i/T' to continue, whereas Algorithm 4 uses '≥'. This is immaterial to the analysis but should be made consistent or explicitly noted.
  5. [§4.3.4, Figure 4.4] The text says the figure shows that the best α varies across datasets, but the main-text figure is explicitly a selection of datasets, and the caption notes that most differences are within confidence intervals. The full sweeps in Appendix B.3.6 should be summarized in the main text so the claim is directly supported.
  6. [§4.3.3] Typo: 'near-optional' should be 'near-optimal'.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the main derivations are self-contained; self-citations are provenance, not load-bearing.

full rationale

I find no step in the paper where a claimed prediction or derivation reduces by construction to an input, fitted parameter, or same-author citation. The worst-case lower and upper bounds (Theorems 3.2.1, 3.3.4, 3.4.3) are proved directly against adversarial instances using Yao's principle and an explicit recurrence; no fitted value is later renamed as a prediction. The data-driven tuning in Chapter 4 is formally evaluated on fresh draws from the same distribution via uniform-convergence bounds, and the parameter choice is selected by ERM on historical instances rather than tuned to the test instance. The social-modeling chapters derive pessimism traps, subsidy interventions, and grit effects from explicitly stated Bayesian/expected-utility dynamics and formal model assumptions, not from constants fit to the phenomena they reproduce. The thesis's heavy self-citation (the chapters are based on four of the author's prior papers) is bibliographic provenance, and the cited [BR25] algorithm is re-analyzed and proved in the thesis itself, so the self-citations are not load-bearing. The skeptical note about Lemma 4.3.3 (Q_D <= kT counting the Cartesian product as kT instead of T^k) identifies an internal proof gap in the sample-complexity analysis, but that is a correctness issue, not circularity: even if the bound were T^k, the result would still be polynomial and would not make the theorem an input of itself. Overall, the paper's central claims have independent content and are not forced by definition or self-reference.

Assumptions & free parameters 3 free parameters · 4 assumptions · 0 invented entities

The formal innovations (PTRR_α, Hybrid_α,B, β_I) are definitions and algorithms, not unobservable entities. The load-bearing external inputs are the concavity assumption, the iid-distribution assumption, and the rational-agent idealization in the social chapters.

free parameters (3)
  • α (PTRR abandonment-threshold exponent) = best value on the grid 0.1…1.0 per LCDB dataset (Sec. 4.3.4); learned via ERM in Sec. 4.3.3
    The algorithm family's performance hinges on α; the empirical sweep selects it per dataset, and the sample-complexity theorem treats it as learnable from historical instances.
  • m (estimate of best arm's final reward) = learned by exploration in Algorithm 2; stated as τ/T·f*(T) when known
    Algorithm 1's keep/abandon threshold uses m; the guarantee in Theorem 3.3.4 requires m within a constant factor of f*(T), which Section 3.4 obtains at the cost of a log k factor.
  • B (Stage-1 switch time in Hybrid_α,B) = learned from data; no closed form given
    The best-of-both-worlds BAI algorithm's exact-vs-approximate tradeoff depends on B; Section 4.4.3 gives sample-complexity bounds for tuning B together with α.
assumptions (4)
  • domain assumption Each arm's reward function is nondecreasing with diminishing returns and f(0)=0
    Definition 2.2.3; without it the good arm can be indistinguishable from bad arms until too late (Section 2.2.3). All IMAB bounds rely on this.
  • standard math The adversary is oblivious and lower bounds are obtained via Yao's principle
    Section 2.2.1 restricts to oblivious adversaries; Section 3.2 applies Yao's principle to convert a deterministic-instance distribution lower bound into a randomized lower bound.
  • domain assumption Historical instances are iid draws from the same distribution D as the deployment instance
    Definition 4.2.2 (Hyperparameter Transfer Setting); the sample-complexity guarantee does not cover distribution shift.
  • domain assumption Agents in the social models are rational Bayesian/expected-utility maximizers
    Chapters 6–7; Section 5.1.4 explicitly acknowledges this is an idealization and that it makes it harder to judge real-world relevance.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Algorithmic Approaches to Sequential Decision-Making and Social Epistemology." pith.science (2026). https://pith.science/paper/DPJFXL5I

@misc{pith2026260720636,
  author       = {Pith},
  title        = {Pith review of: Algorithmic Approaches to Sequential Decision-Making and Social Epistemology},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DPJFXL5I}},
  note         = {Machine review of arXiv:2607.20636}
}
read the original abstract

As humans, we face many decisions that require us to choose between sticking to something and giving up. This thesis uses algorithmic tools to derive insights about such decision-making problems in theoretical models, studying both near-optimal methods and outcomes of social and behavioral influences. Along the way, this thesis sheds light on what we gain and what we lose as we move from a messy and complex real world setting to a very general abstract model by studying various points along this spectrum. In Part I, we study algorithms for sequential decision-making in the improving multi-armed bandits problem. We provide nearly matching upper and lower bounds in the general case. Then, we then ask what is possible if we have access to similar instances to the one we wish to deploy our algorithm on. To that end, we provide guarantees in the data-driven algorithm design framework, showing that a polynomial number of samples is sufficient for learning good algorithms from a class of algorithms. In Part II, we study algorithmic approaches for problems in social epistemology. We start by analyzing what role theoretical models can play in the study of social problems. We then study social and behavioral influences in decision-making requiring investment. First, we provide mathematical formalism in which to study the formation of pessimism traps, a phenomenon identified by philosophers in which agents are influenced by their predecessors to engage in less-ambitious goals. We develop financial interventions to sustainably shift communities out of these traps. The second problem we study is the influence of grit as a behavioral trait in ambitious decision-making. Overall, these works seek to theoretically model phenomena in social epistemology and provide a framework for intervening algorithmically.

Figures

Figures reproduced from arXiv: 2607.20636 by the authors.

Figure 4.1
Figure 4.1. This figure summarizes the framework studied in this chapter. In phase 1 [PITH_FULL_IMAGE:figures/full_fig_p045_4_1.png] view at source ↗
Figure 4.2
Figure 4.2. This figure shows a snapshot of running PTRR with differing [PITH_FULL_IMAGE:figures/full_fig_p048_4_2.png] view at source ↗
Figure 4.3
Figure 4.3. Lower bound instances: The spirit of the lower bound instances is that most arms flatten after T /√ k pulls but one arm keeps increasing. However, since the algorithm needs to play any arm for a while before figuring out whether it is the good arm or one of the regular arms, the expected reward of the algorithm cannot exceed a certain amount. On the left, we reproduce the instance for β = 1 , recovering the lower bo… view at source ↗
Figures from the paper (10 more)
Figure 4.4
Figure 4.4. Figure 4.4: Sensitivity of PTRRα to α on selected LCDB instances (T = 44, k = 22). Each curve corresponds to one CC-18 dataset d from LCDB 1.1 and reports the nor￾malized cumulative reward E[PTRRα(d)]/OPT(d) as a function of α ∈ {0.1, 0.2, . . . , 1.0}, where OPT(d) = maxi PT t=…
Figure 4.5
Figure 4.5. Figure 4.5: Mean LCDB reward curves for three datasets with distinct best α values on the grid. Each panel overlays the mean reward curves ri,d(t) = 1 − erri,d(t) across anchors t for all k = 22 arms on a single CC-18 dataset d. The title of each panel reports the value of α ∈ {…
Figure 4.6
Figure 4.6. Figure 4.6: Examples demonstrating the need for a best-of-both-worlds approach. [PITH_FULL_IMAGE:figures/full_fig_p054_4_6.png]
Figure 6
Figure 6. Figure 6: shows the proportion of correct cascades when a financial supplement is provided [PITH_FULL_IMAGE:figures/full_fig_p089_6.png]
Figure 6.1
Figure 6.1. Figure 6.1: Impact of Financial Supplement on Finding Correct Cascade with Supplement, [PITH_FULL_IMAGE:figures/full_fig_p090_6_1.png]
Figure 6.2
Figure 6.2. Figure 6.2: Probability of Finding Correct Cascade without Supplement [PITH_FULL_IMAGE:figures/full_fig_p090_6_2.png]
Figure 6
Figure 6. Figure 6: presents the average subsidy progression for a population of 100 agents. The [PITH_FULL_IMAGE:figures/full_fig_p090_6.png]
Figure 6.3
Figure 6.3. Figure 6.3: Average Subsidy Progression for 100 Agents [PITH_FULL_IMAGE:figures/full_fig_p091_6_3.png]
Figure 7.1
Figure 7.1. Figure 7.1: This table shows the reward the agents described in Section 7.3.2 receive if [PITH_FULL_IMAGE:figures/full_fig_p100_7_1.png]
Figure 7.2
Figure 7.2. Figure 7.2: Switch point as a function of standard deviation [PITH_FULL_IMAGE:figures/full_fig_p107_7_2.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

144 extracted references · 21 canonical work pages

  1. [1]

    Probabilistic computations: Toward a unified measure of complexity , year=

    Yao, Andrew Chi-Chin , booktitle=. Probabilistic computations: Toward a unified measure of complexity , year=

  2. [2]

    Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence , pages =

    Heidari, Hoda and Kearns, Michael and Roth, Aaron , title =. Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence , pages =. 2016 , isbn =

    2016

  3. [3]

    Algorithms -

    The Oil Searching Problem , volume =. Algorithms -. 2009 , langid =. doi:10.1007/978-3-642-04128-0_45 , note =

    work page doi:10.1007/978-3-642-04128-0_45 2009

  4. [4]

    , volume =

    On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. , volume =. Biometrika , author =. doi:10.1093/biomet/25.3-4.285 , pages =

    doi:10.1093/biomet/25.3-4.285

  5. [5]

    Search Games , rights =

    Gal, Shmuel , urldate =. Search Games , rights =. Wiley Encyclopedia of Operations Research and Management Science , publisher =. 2011 , langid =. doi:10.1002/9780470400531.eorms0912 , keywords =

    work page doi:10.1002/9780470400531.eorms0912 2011

  6. [6]

    The Theory of Search Games and Rendezvous , volume =

    Alpern, Steven and Gal, Shmuel , location =. The Theory of Search Games and Rendezvous , volume =. 2003 , langid =. doi:10.1007/b100809 , keywords =

    work page doi:10.1007/b100809 2003

  7. [7]

    Rivest , title =

    Ronald L. Rivest , title =. 2023 , note =

    2023

  8. [8]

    Bandit Algorithms , isbn =

    Lattimore, Tor and Szepesvári, Csaba , urldate =. Bandit Algorithms , isbn =. 2020 , langid =. doi:10.1017/9781108571401 , file =

    doi:10.1017/9781108571401 2020

Show all 144 references
  1. [9]

    Introduction to Multi-Armed Bandits , url =

    Slivkins, Aleksandrs , urldate =. Introduction to Multi-Armed Bandits , url =. 2022 , langid =. 1904.07272 [cs, stat] , keywords =

    2022 arXiv

  2. [10]

    Li, Lisha and Jamieson, Kevin and DeSalvo, Giulia and Rostamizadeh, Afshin and Talwalkar, Ameet , title =. J. Mach. Learn. Res. , month =. 2017 , issue_date =

    2017

  3. [11]

    Sebastian and Tishby, Naftali , date =

    Haussler, David and Kearns, Michael and Seung, H. Sebastian and Tishby, Naftali , date =. Rigorous learning curve bounds from statistical mechanics , volume =. Machine Learning , shortjournal =. doi:10.1007/BF00114010 , pages =

    doi

  4. [12]

    Efficient Automatic

    Li, Yang and Jiang, Jiawei and Gao, Jinyang and Shao, Yingxia and Zhang, Ce and Cui, Bin , urldate =. Efficient Automatic. Proceedings of the. 2020 , eprinttype =. doi:10.1609/aaai.v34i04.5910 , pages =. 2012.04371 [cs, stat] , keywords =

    2020 arXiv

  5. [13]

    Online Computation and Competitive Analysis , isbn =

    Borodin, Allan and El-Yaniv, Ran , year =. Online Computation and Competitive Analysis , isbn =

  6. [14]

    A Theory of Fads, Fashion, Custom, and Cultural Change as Informational Cascades , urldate =

    Sushil Bikhchandani and David Hirshleifer and Ivo Welch , journal =. A Theory of Fads, Fashion, Custom, and Cultural Change as Informational Cascades , urldate =

  7. [15]

    Banerjee , journal =

    Abhijit V. Banerjee , journal =. A Simple Model of Herd Behavior , urldate =

  8. [16]

    Paul and Jennifer M

    Sarah K. Paul and Jennifer M. Morton , doi =. Grit , volume =. Ethics , number =

  9. [17]

    Pathological Outcomes of Observational Learning , urldate =

    Lones Smith and Peter Sørensen , journal =. Pathological Outcomes of Observational Learning , urldate =

  10. [18]

    Finite-time Analysis of the Multiarmed Bandit Problem , volume =

    Auer, Peter and Cesa-Bianchi, Nicolò and Fischer, Paul , year =. Finite-time Analysis of the Multiarmed Bandit Problem , volume =. Machine Learning , doi =

  11. [19]

    and Hedge, M.V

    Agrawal, R. and Hedge, M.V. and Teneketzis, D. , journal=. Asymptotically efficient adaptive allocation rules for the multiarmed bandit problem with switching cost , year=

  12. [20]

    Auer, Peter , title =. J. Mach. Learn. Res. , month =. 2003 , issue_date =

    2003

  13. [21]

    Sample Mean Based Index Policies with O(log n) Regret for the Multi-Armed Bandit Problem , urldate =

    Rajeev Agrawal , journal =. Sample Mean Based Index Policies with O(log n) Regret for the Multi-Armed Bandit Problem , urldate =

  14. [22]

    2023 , eprint=

    On Statistical Discrimination as a Failure of Social Learning: A Multi-Armed Bandit Approach , author=. 2023 , eprint=

    2023

  15. [23]

    Algorithmica , year=

    Competitive randomized algorithms for nonuniform problems , author=. Algorithmica , year=

  16. [24]

    Autonomous Agents and Multi-Agent Systems , year=

    Majority dynamics and aggregation of information in social networks , author=. Autonomous Agents and Multi-Agent Systems , year=

  17. [25]

    Journal of Finance , year=

    Sequential Sales, Learning, and Cascades , author=. Journal of Finance , year=

  18. [26]

    On the performance of competitive algorithms in practice

    Karlin, Anna R. On the performance of competitive algorithms in practice. Online Algorithms: The State of the Art. 1998. doi:10.1007/BFb0029577

    1998 doi

  19. [27]

    Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics , pages =

    On Bayesian Upper Confidence Bounds for Bandit Problems , author =. Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics , pages =. 2012 , editor =

    2012

  20. [29]

    Journal of Personality and Social Psychology , volume=

    Grit: The power of passion and perseverance , author=. Journal of Personality and Social Psychology , volume=. 2007 , publisher=

    2007

  21. [30]

    Journal of Personality and Social Psychology , volume=

    Grit: Perseverance and passion for long-term goals , author=. Journal of Personality and Social Psychology , volume=. 2007 , publisher=

    2007

  22. [31]

    Annual Review of Sociology , volume=

    Social Exclusion and Ethnic Groups: The Challenge to Economics , author=. Annual Review of Sociology , volume=. 2002 , publisher=

    2002

  23. [32]

    Loury , journal =

    Stephen Coate and Glenn C. Loury , journal =. Will Affirmative-Action Policies Eliminate Negative Stereotypes? , urldate =

  24. [33]

    1974 , publisher=

    Limits of Organization , author=. 1974 , publisher=

    1974

  25. [34]

    Will Affirmative-Action Policies Eliminate Negative Stereotypes? , volume =

    Coate, Stephen and Loury, Glenn , year =. Will Affirmative-Action Policies Eliminate Negative Stereotypes? , volume =

  26. [35]

    Journal of Political Economy , volume =

    Bikhchandani, Sushil and Hirshleifer, David and Welch, Ivo , title =. Journal of Political Economy , volume =. 1992 , doi =. https://doi.org/10.1086/261849 , abstract =

    1992 doi

  27. [36]

    The Journal of Behavioral Finance , volume=

    Social mood and financial economics , author=. The Journal of Behavioral Finance , volume=. 2005 , publisher=

    2005

  28. [37]

    The Quarterly Journal of Economics , volume=

    The Market for "Lemons": Quality Uncertainty and the Market Mechanism , author=. The Quarterly Journal of Economics , volume=. 1970 , publisher=

    1970

  29. [38]

    2007 , publisher=

    Epistemic Injustice: Power and the Ethics of Knowing , author=. 2007 , publisher=

    2007

  30. [39]

    2010 , publisher=

    Networks, Crowds, and Markets: Reasoning about a Highly Connected World , author=. 2010 , publisher=

    2010

  31. [40]

    NBER Working Paper , year=

    Behavioral Economics , author=. NBER Working Paper , year=

  32. [41]

    arXiv preprint arXiv:2306.11112 , year=

    Correcting Underrepresentation and Intersectional Bias for Fair Classification , author=. arXiv preprint arXiv:2306.11112 , year=

    arXiv

  33. [42]

    arXiv preprint arXiv:1912.01094 , year=

    Recovering from biased data: Can fairness constraints improve accuracy? , author=. arXiv preprint arXiv:1912.01094 , year=

    1912 arXiv

  34. [43]

    Exploring by Believing , volume =

    Sara Aronowitz , doi =. Exploring by Believing , volume =. Philosophical Review , number =

  35. [44]

    and Heifetz, Aviad , urldate =

    Aumann, Robert J. and Heifetz, Aviad , urldate =. Chapter 43 Incomplete information , volume =. Handbook of Game Theory with Economic Applications , publisher =. doi:10.1016/S1574-0005(02)03006-0 , keywords =

    doi

  36. [45]

    , title =

    Chamley, Christophe P. , title =. 2003 , isbn =. doi:10.1017/CBO9780511616372 , note =

    2003 doi

  37. [46]

    Opinion Dynamics and Learning in Social Networks , volume =

    Acemoglu, Daron and Ozdaglar, Asuman , urldate =. Opinion Dynamics and Learning in Social Networks , volume =. Dynamic Games and Applications , shortjournal =. doi:10.1007/s13235-010-0004-1 , pages =

    doi

  38. [47]

    Sîrbu, Alina and Loreto, Vittorio and Servedio, Vito D. P. and Tria, Francesca , editor =. Opinion Dynamics: Models, Extensions and External Effects , isbn =. Participatory Sensing, Opinions and Collective Awareness , publisher =. 2017 , langid =. doi:10.1007/978-3-319-25658-0...

    2017 doi

  39. [48]

    Modeling opinion dynamics in social networks , isbn =

    Das, Abhimanyu and Gollapudi, Sreenivas and Munagala, Kamesh , urldate =. Modeling opinion dynamics in social networks , isbn =. Proceedings of the 7th. doi:10.1145/2556195.2559896 , series =

  40. [49]

    Harsanyi, John C. , year=. Rational Behaviour and Bargaining Equilibrium in Games and Social Situations , publisher=

  41. [50]

    Cohen and Julio Garcia and Nancy Apfel and Allison Master , title =

    Geoffrey L. Cohen and Julio Garcia and Nancy Apfel and Allison Master , title =. Science , volume =. 2006 , doi =

    2006

  42. [51]

    Proceedings of the 2018 ACM Conference on Economics and Computation , pages =

    Mossel, Elchanan and Mueller-Frank, Manuel and Sly, Allan and Tamuz, Omer , title =. Proceedings of the 2018 ACM Conference on Economics and Computation , pages =. 2018 , isbn =. doi:10.1145/3219166.3219207 , abstract =

    2018

  43. [52]

    SIAM journal on computing (Print) , year=

    Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior , author=. SIAM journal on computing (Print) , year=

  44. [53]

    The Quarterly Journal of Economics , volume=

    A simple model of herd behavior , author=. The Quarterly Journal of Economics , volume=. 1992 , publisher=

    1992

  45. [54]

    The Review of Economic Studies , volume=

    Identification of Endogenous Social Effects: The Reflection Problem , author=. The Review of Economic Studies , volume=. 1993 , publisher=

    1993

  46. [55]

    2008 , publisher=

    Nudge: Improving Decisions About Health, Wealth, and Happiness , author=. 2008 , publisher=

    2008

  47. [56]

    Science , volume=

    Judgment under Uncertainty: Heuristics and Biases , author=. Science , volume=. 1974 , publisher=

    1974

  48. [57]

    2001 , publisher=

    Republic.com , author=. 2001 , publisher=

    2001

  49. [58]

    Marketing Letters , volume=

    Beyond nudges: Tools of a choice architecture , author=. Marketing Letters , volume=. 2012 , publisher=

    2012

  50. [59]

    Psychological Science , volume=

    Should governments invest more in nudging? , author=. Psychological Science , volume=. 2017 , publisher=

    2017

  51. [60]

    American Economic Review , volume=

    Information cascades in the laboratory , author=. American Economic Review , volume=. 1997 , publisher=

    1997

  52. [61]

    Journal of Political Economy , volume=

    A theory of fads, fashion, custom, and cultural change as informational cascades , author=. Journal of Political Economy , volume=. 1992 , publisher=

    1992

  53. [62]

    American Economic Journal: Microeconomics , volume=

    A theory of information cascades with endogenous signal precision , author=. American Economic Journal: Microeconomics , volume=. 2011 , publisher=

    2011

  54. [63]

    The Quarterly Journal of Economics , volume=

    A theory of social custom, of which unemployment may be one consequence , author=. The Quarterly Journal of Economics , volume=. 1980 , publisher=

    1980

  55. [64]

    2016 , publisher=

    Grit: The Power of Passion and Perseverance , author=. 2016 , publisher=

    2016

  56. [65]

    Ethics , volume=

    Grit , author=. Ethics , volume=. 2019 , publisher=

    2019

  57. [66]

    Philosophy and Phenomenological Research , volume=

    Resisting pessimism traps: the limits of believing in oneself , author=. Philosophy and Phenomenological Research , volume=. 2022 , publisher=

    2022

  58. [67]

    6th Symposium on Foundations of Responsible Computing (FORC 2025) , series =

    Blum, Avrim and Diana, Emily and Ravichandran, Kavya and Tolbert, Alexander , title =. 6th Symposium on Foundations of Responsible Computing (FORC 2025) , series =. 2025 , volume =

    2025

  59. [68]

    Observational learning with fake agents , year =

    Poojary, Pawan and Berry, Randall , booktitle =. Observational learning with fake agents , year =

  60. [69]

    Precarious Mobility: Trying and Failing to Get Ahead in the 21st Century , rights =

    Wooten, Tom , urldate =. Precarious Mobility: Trying and Failing to Get Ahead in the 21st Century , rights =. 2022 , school =

    2022

  61. [70]

    Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits , isbn =

    Patil, Vishakha and Nair, Vineet and Ghalme, Ganesh and Khan, Arindam , urldate =. Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits , isbn =. Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence ,...

    2023 doi

  62. [71]

    Permissivism, Underdetermination, and Evidence , isbn =

    Jackson, Elizabeth and. Permissivism, Underdetermination, and Evidence , isbn =. The Routledge Handbook of the Philosophy of Evidence , publisher =. 2023 , langid =. doi:10.4324/9781315672687-33 , file =

    2023 doi

  63. [72]

    Problem with 'Grit,'

    Snyder, Jeffrey Aaron , year =. Problem with 'Grit,'

  64. [73]

    A Key Researcher Says 'Grit' Isn't Ready For High-Stakes Measures , url =

    Kamenetz, Anya , urldate =. A Key Researcher Says 'Grit' Isn't Ready For High-Stakes Measures , url =. 2015 , langid =

    2015

  65. [74]

    Humanities , year =

    Martin Seligman and the Rise of Positive Psychology , author =. Humanities , year =

  66. [75]

    2000 , titleaddon =

    Bayesian Theory , author =. 2000 , titleaddon =

    2000

  67. [76]

    Proceedings of The 36th International Conference on Algorithmic Learning Theory , pages =

    Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem , author =. Proceedings of The 36th International Conference on Algorithmic Learning Theory , pages =. 2025 , editor =

    2025

  68. [77]

    Learned Optimism: How to Change Your Mind and Your Life , publisher =

    Seligman, Martin , year =. Learned Optimism: How to Change Your Mind and Your Life , publisher =

  69. [78]

    Authentic Happiness: Using the New Positive Psychology to Realize Your Potential for Lasting Fulfillment , isbn =

    Seligman, Martin , year =. Authentic Happiness: Using the New Positive Psychology to Realize Your Potential for Lasting Fulfillment , isbn =

  70. [79]

    Short-Term Impacts of Targeted Cash Grants and Business Development Services: Experimental Evidence from Entrepreneurs in Burkina Faso , url =

    Grimm, Michael and Soubeiga, Sidiki and Weber, Michael , urldate =. Short-Term Impacts of Targeted Cash Grants and Business Development Services: Experimental Evidence from Entrepreneurs in Burkina Faso , url =. 2021 , langid =. doi:10.1596/1813-9450-9877 , file =

    2021 doi

  71. [80]

    and Safir, Abla and Zia, Bilal , urldate =

    Domenella, Yanina and Jamison, Julian C. and Safir, Abla and Zia, Bilal , urldate =. Can Business Grants Mitigate a Crisis? Evidence from Youth Entrepreneurs in Kenya during. World Bank, Washington,. 2021 , langid =

    2021

  72. [81]

    Can automatic calculating machines be said to think? , url =

  73. [82]

    , urldate =

    Citri, Ami and Malenka, Robert C. , urldate =. Synaptic Plasticity: Multiple Forms, Functions, and Mechanisms , volume =. 2008 , langid =. doi:10.1038/sj.npp.1301559 , shorttitle =

    2008 doi

  74. [83]

    1950 , file =

    I.—. 1950 , file =. doi:10.1093/mind/LIX.236.433 , pages =

    1950 doi

  75. [84]

    , year =

    Morton, J.M. , year =. Moving Up Without Losing Your Way: The Ethical Costs of Upward Mobility , isbn =

  76. [85]

    and Mukherji, Pinaki , urldate =

    Gandhi, Mustafa H. and Mukherji, Pinaki , urldate =. Learning Theories , rights =. 2025 , pmid =

    2025

  77. [86]

    Goel, Ashok , title =

  78. [87]

    Proceedings of the 41st International Conference on Machine Learning , pages=

    Best arm identification for stochastic rising bandits , author=. Proceedings of the 41st International Conference on Machine Learning , pages=

  79. [88]

    International Conference on Machine Learning , pages=

    Stochastic rising bandits , author=. International Conference on Machine Learning , pages=. 2022 , organization=

    2022

  80. [89]

    2020 , publisher=

    Maria-Florina Balcan , booktitle=. 2020 , publisher=

    2020

  81. [90]

    2025 , isbn =

    Sharma, Dravyansh and Suggala, Arun , title =. 2025 , isbn =. doi:10.1609/aaai.v39i19.34243 , booktitle =

    2025 doi

  82. [91]

    Conference on Learning Theory , pages=

    Corralling a band of bandit algorithms , author=. Conference on Learning Theory , pages=. 2017 , organization=

    2017

  83. [92]

    Conference on Learning Theory , pages=

    Corralling a larger band of bandits: A case study on switching regret for linear bandits , author=. Conference on Learning Theory , pages=. 2022 , organization=

    2022

  84. [93]

    International Conference on Artificial Intelligence and Statistics , pages=

    Corralling stochastic bandit algorithms , author=. International Conference on Artificial Intelligence and Statistics , pages=. 2021 , organization=

    2021

  85. [94]

    The Thirty-ninth Annual Conference on Neural Information Processing Systems Datasets and Benchmarks Track , year=

    LCDB 1.1: A Database Illustrating Learning Curves Are More Ill-Behaved Than Previously Thought , author=. The Thirty-ninth Annual Conference on Neural Information Processing Systems Datasets and Benchmarks Track , year=

  86. [95]

    Journal of Machine Learning Research , volume=

    Tracking the best linear predictor , author=. Journal of Machine Learning Research , volume=

  87. [96]

    International Conference on Artificial Intelligence and Statistics , pages=

    Learning piecewise Lipschitz functions in changing environments , author=. International Conference on Artificial Intelligence and Statistics , pages=. 2020 , organization=

    2020

  88. [97]

    Epistemology in Chinese Philosophy , url =

    Rosker, Jana , editor =. Epistemology in Chinese Philosophy , url =. The Stanford Encyclopedia of Philosophy , publisher =. 2025 , keywords =

    2025

  89. [98]

    Journal of Social Issues , author =

    Neoliberal Ideology and the Justification of Inequality in Capitalist Societies: Why Social and Economic Dimensions of Ideology Are Intertwined , volume =. Journal of Social Issues , author =. 2019 , langid =. doi:10.1111/josi.12310 , shorttitle =

    2019 doi

  90. [99]

    Gupta, Rishi and Roughgarden, Tim , booktitle=. A

  91. [100]

    Conference on Learning Theory , pages=

    Learning-theoretic foundations of algorithm configuration for combinatorial partitioning problems , author=. Conference on Learning Theory , pages=. 2017 , organization=

    2017

  92. [101]

    2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) , pages=

    Dispersion for data-driven algorithm design, online learning, and private optimization , author=. 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) , pages=. 2018 , organization=

    2018

  93. [102]

    2021 , organization=

    Learning complexity of simulated annealing , author=. 2021 , organization=

    2021

  94. [103]

    Conference on Learning Theory (COLT) , pages=

    Generalization bounds for data-driven numerical linear algebra , author=. Conference on Learning Theory (COLT) , pages=. 2022 , organization=

    2022

  95. [104]

    Advances in Neural Information Processing Systems , year=

    Sample Complexity of Posted Pricing for a Single Item , author=. Advances in Neural Information Processing Systems , year=

  96. [105]

    Advances in Neural Information Processing Systems , volume=

    Learning cut generating functions for integer programming , author=. Advances in Neural Information Processing Systems , volume=

  97. [106]

    Advances in Neural Information Processing Systems , volume=

    Generalization bound and learning methods for data-driven projections in linear programming , author=. Advances in Neural Information Processing Systems , volume=

  98. [107]

    2024 , journal=

    Learning to Relax: Setting Solver Parameters Across a Sequence of Linear System Instances , author=. 2024 , journal=

    2024

  99. [108]

    Uncertainty in Artificial Intelligence , pages=

    Learning Accurate and Interpretable Decision Trees , author=. Uncertainty in Artificial Intelligence , pages=. 2024 , organization=

    2024

  100. [109]

    2024 , isbn =

    Sharma, Dravyansh , title =. 2024 , isbn =. doi:10.1609/aaai.v38i13.29412 , booktitle =

    2024 doi

  101. [110]

    Transactions on Machine Learning Research , year=

    Algorithm Configuration for Structured Pfaffian Settings , author=. Transactions on Machine Learning Research , year=

  102. [111]

    The Thirty-ninth Annual Conference on Neural Information Processing Systems , year=

    Accelerating data-driven algorithm selection for combinatorial partitioning problems , author=. The Thirty-ninth Annual Conference on Neural Information Processing Systems , year=

  103. [112]

    Advances in Neural Information Processing Systems , volume=

    Meta-learning adversarial bandit algorithms , author=. Advances in Neural Information Processing Systems , volume=

  104. [113]

    Advances in Neural Information Processing Systems , volume=

    Accelerating ERM for data-driven algorithm design using output-sensitive techniques , author=. Advances in Neural Information Processing Systems , volume=

  105. [114]

    AAAI 2026 Artificial Intelligence for Social Impact Track , year=

    A Theoretical Model for Grit in Pursuing Ambitious Ends , author=. AAAI 2026 Artificial Intelligence for Social Impact Track , year=

    2026

  106. [115]

    2026 , booktitle =

    Algorithm design and sharper bounds for the improving multi-armed bandits problem , author=. 2026 , booktitle =

    2026

  107. [116]

    Frigg, Roman and Hartmann, Stephan , title =. The. 2025 , edition =

    2025

  108. [117]

    , title =

    Elgin, Catherine Z. , title =. 2017 , month =. doi:10.7551/mitpress/9780262036535.001.0001 , url =

    2017

  109. [118]

    Batterman and Collin C

    Robert W. Batterman and Collin C. Rice , journal =. Minimal Model Explanations , urldate =

  110. [119]

    Philosophy Compass , volume =

    Valentini, Laura , title =. Philosophy Compass , volume =. doi:https://doi.org/10.1111/j.1747-9991.2012.00500.x , url =. https://compass.onlinelibrary.wiley.com/doi/pdf/10.1111/j.1747-9991.2012.00500.x , year =

    2012

  111. [120]

    Economic Fables

    Rubinstein, Ariel. Economic Fables

  112. [121]

    2004 , month =

    Woodward, James , title =. 2004 , month =. doi:10.1093/0195155270.001.0001 , url =

    2004 doi

  113. [122]

    Sources of Power: How People Make Decisions , volume =

    Klein, Gary , year =. Sources of Power: How People Make Decisions , volume =. Leadership and Management in Engineering , doi =

  114. [123]

    2023 , eprint=

    Introduction to Online Convex Optimization , author=. 2023 , eprint=

    2023

  115. [124]

    Beyond the Worst-Case Analysis of Algorithms , publisher=

    Tim Roughgarden , place=. Beyond the Worst-Case Analysis of Algorithms , publisher=

  116. [125]

    Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , chapter =

    Shuchi Chawla and Dimitrios Christou and Amit Harlev and Ziv Scully , title =. Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , chapter =. doi:10.1137/1.9781611978971.26 , URL =

    2026 doi

  117. [126]

    SIGecom Exch

    Beyhaghi, Hedyeh and Cai, Linda , title =. SIGecom Exch. , month = oct, pages =. 2024 , issue_date =. doi:10.1145/3699814.3699817 , abstract =

    2024

  118. [127]

    2026 , eprint=

    The Pandora's Box Problem with Sequential Inspections , author=. 2026 , eprint=

    2026

  119. [128]

    On the Power of Randomization in On-Line Algorithms

    Ben-David, Shai and Borodin, Allan and Karp, Richard and Tardos, Gábor and Wigderson, Avi , year =. On the Power of Randomization in On-Line Algorithms. , volume =. Algorithmica , doi =

  120. [129]

    Philosophy of Science , author=

    Model Evaluation: An Adequacy-for-Purpose View , volume=. Philosophy of Science , author=. 2020 , pages=. doi:10.1086/708691 , number=

    2020 doi

  121. [130]

    Philosophy of Anthropology and Sociology , publisher =

    Causal models in the social sciences , editor =. Philosophy of Anthropology and Sociology , publisher =. 2007 , series =. doi:https://doi.org/10.1016/B978-044451542-1/50006-4 , url =

    2007 doi

  122. [131]

    What is the Point of Prediction?

    Elliott-Graves, Alkistis. What is the Point of Prediction?. The Perils and Promises of Prediction in the Natural Sciences: Historical and Epistemological Perspectives. 2026. doi:10.1007/978-3-032-11706-9_2

    2026 doi

  123. [132]

    Philosophy Compass , volume =

    Elliott-Graves, Alkistis and Weisberg, Michael , title =. Philosophy Compass , volume =. doi:https://doi.org/10.1111/phc3.12109 , url =. https://compass.onlinelibrary.wiley.com/doi/pdf/10.1111/phc3.12109 , abstract =

    doi

  124. [133]

    2020 , url=

    Abstraction and Representational Capacity in Computational Structures , author=. 2020 , url=

    2020

  125. [134]

    The British Journal for the Philosophy of Science , volume =

    Michael Weisberg , title =. The British Journal for the Philosophy of Science , volume =. 2007 , doi =

    2007

  126. [135]

    Validating Idealized Models , urldate =

    Michael Weisberg , booktitle =. Validating Idealized Models , urldate =

  127. [136]

    Philosophy of Science , author=

    Transparency in Complex Computational Systems , volume=. Philosophy of Science , author=. 2020 , pages=. doi:10.1086/709729 , number=

    2020 doi

  128. [137]

    Philosophy of history , author=

  129. [138]

    Laws and explanation in history , author=

  130. [139]

    Confirmation and explaining how possible , journal =

    Patrick Forber , keywords =. Confirmation and explaining how possible , journal =. 2010 , issn =. doi:https://doi.org/10.1016/j.shpsc.2009.12.006 , url =

    2010 doi

  131. [140]

    2019 , issn =

    How could models possibly provide how-possibly explanations? , journal =. 2019 , issn =. doi:https://doi.org/10.1016/j.shpsa.2018.06.008 , url =

    2019 doi

  132. [141]

    Methods in the Philosophy of Science: A User's Guide , publisher=

    Methods for modelers of science , author=. Methods in the Philosophy of Science: A User's Guide , publisher=

  133. [142]

    Emrah Aydinonat , title =

    Petri Ylikoski and N. Emrah Aydinonat , title =. Journal of Economic Methodology , volume =. 2014 , publisher =. doi:10.1080/1350178X.2014.886470 , URL =

    2014

  134. [143]

    Schelling , title =

    Thomas C. Schelling , title =. The Journal of Mathematical Sociology , volume =. 1971 , publisher =. doi:10.1080/0022250X.1971.9989794 , URL =

    1971

  135. [144]

    2017 , month =

    Potochnik, Angela , title =. 2017 , month =. doi:10.7208/chicago/9780226507194.001.0001 , url =

    2017

  136. [145]

    Proceedings of the 46th Annual Meeting of the Cognitive Science Society, CogSci 2024, Rotterdam, The Netherlands, July 24-27, 2024 , editor =

    Caregiver presence promotes judgements of exploration , author =. Proceedings of the 46th Annual Meeting of the Cognitive Science Society, CogSci 2024, Rotterdam, The Netherlands, July 24-27, 2024 , editor =. 2024 , url =

    2024

Pith tools

Reviewed August 1, 2026 · model on record in the stance chip above.