MétaCan
Menu
Back to cohort
Record W4403262715 · doi:10.1111/phib.12361

What Second‐Best Epistemology Could Be

2024· article· en· W4403262715 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueAnalytic Philosophy · 2024
Typearticle
Languageen
FieldArts and Humanities
TopicEpistemology, Ethics, and Metaphysics
Canadian institutionsÉcole de Technologie Supérieure
FundersSocial Sciences and Humanities Research Council of CanadaFonds de Recherche du Québec-Société et Culture
KeywordsEpistemologyPhilosophy

Abstract

fetched live from OpenAlex

ABSTRACT According to the Theory of the Second Best, in non‐ideal circumstances, approximating ideals might be suboptimal (with respect to a specific interpretation of what “approximating an ideal” means). In this paper, I argue that the formal model underlying the Theory can apply to problems in epistemology. Two applications are discussed: First, in some circumstances, second‐best problems arise in Bayesian settings. Second, the division of epistemic labor can be subject to second‐best problems. These results matter. They allow us to evaluate the claim, made by many philosophers, that second‐best problems have import in epistemology (and the specific conditions under which the Theory finds applications). They also allow us to see that talk of “approximating an ideal” is ambiguous, and to clarify the conditions in which approximating an epistemic ideal might be beneficial.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Other · Consensus signal: none
Teacher disagreement score0.889
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0000.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0030.002

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.118
GPT teacher head0.313
Teacher spread0.195 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it