{"schema":"theorempath-claim-index/1","site":"https://theorempath.com","publisher":"TheoremPath","author":{"name":"Robby Sneiderman","url":"https://robbysneiderman.com/"},"license":"All rights reserved. Non-commercial quotation with attribution permitted.","pageKind":"reference page","reviewProcess":"Written and maintained by the named author. Not peer reviewed and not refereed by any venue. Each claim below carries its own verification status.","idFormat":"claim:<topic>::<localId>","urlFormat":"https://theorempath.com/topics/<topic>#<localId>","scope":{"covers":"1,178 of the 1,231 statements this site records, on 610 published topic pages. Selected by one rule: a theorem, lemma, corollary, or proposition block on a published topic page.","inclusionRule":"A theorem, lemma, corollary, or proposition block on a published topic page.","notListed":["Definition blocks are not listed. The extractor behind this index reads theorem, lemma, corollary and proposition blocks and nothing else, so a definition on a topic page has no entry here.","27 statements on 23 served comparison pages are not listed. A comparison page is not a topic page, so its statements carry no identifier in the format above.","Statements in the other Path sections of this site sit outside the two directories the extractor reads. No committed record holds them, so this index can neither list them nor count them.","26 statements sit on topic files that are not published. Those pages are not served, so the statements have no anchor to resolve to."],"governedClaims":1231},"verificationVocabulary":{"informal_only":"No source citation and no proof check recorded.","source_checked":"A source in this site's registry is recorded against it. Read sourceRoles: a proof or definition role is support for the statement, a background or historical role is not.","human_proof_checked":"A person worked the proof and recorded the check.","formal_statement_written":"A Lean statement fixes the wording; no proof yet.","lean_verified":"A Lean proof checks a formal statement mapped to it.","simulation_validated":"A recorded simulation agrees with it.","empirical_reported":"It reports a measurement, with the measurement's own conditions.","not_verifiable":"Not stated in a form that can be checked here."},"counts":{"topics":610,"claims":1178,"byVerification":{"informal_only":1003,"lean_verified":56,"source_checked":119}},"topics":[{"topic":"ablation-study-design","url":"https://theorempath.com/topics/ablation-study-design","title":"Ablation Study Design","reviewedOn":"2026-04-26","claims":[{"localId":"paired-ablation-power","kind":"proposition","title":"Paired Comparison Reduces Variance","verification":"informal_only","review":"needs_review"}]},{"topic":"activation-checkpointing","url":"https://theorempath.com/topics/activation-checkpointing","title":"Activation Checkpointing","reviewedOn":"2026-04-18","claims":[{"localId":"checkpoint-memory-bound","kind":"theorem","title":"Optimal Checkpoint Memory Bound","verification":"informal_only","review":"needs_review"}]},{"topic":"activation-functions","url":"https://theorempath.com/topics/activation-functions","title":"Activation Functions","reviewedOn":"2026-04-26","claims":[{"localId":"universal-approximation-requires-nonlinearity","kind":"theorem","title":"Nonlinearity Is Necessary for Universal Approximation","verification":"informal_only","review":"needs_review"}]},{"topic":"active-slam-and-pomdps","url":"https://theorempath.com/topics/active-slam-and-pomdps","title":"Active SLAM and POMDPs","reviewedOn":"2026-04-18","claims":[{"localId":"belief-space-bellman-equation","kind":"theorem","title":"Bellman Equation in Belief Space","verification":"informal_only","review":"needs_review"}]},{"topic":"actor-critic-methods","url":"https://theorempath.com/topics/actor-critic-methods","title":"Actor-Critic Methods","reviewedOn":"2026-04-24","claims":[{"localId":"gae-bias-variance","kind":"proposition","title":"GAE Bias-Variance Tradeoff","verification":"informal_only","review":"needs_review"},{"localId":"ppo-clipped-surrogate","kind":"proposition","title":"PPO Clipped Surrogate Objective","verification":"informal_only","review":"draft"},{"localId":"sac-soft-bellman","kind":"proposition","title":"Soft Bellman Equation","verification":"informal_only","review":"needs_review"}]},{"topic":"adaboost","url":"https://theorempath.com/topics/adaboost","title":"AdaBoost","reviewedOn":"2026-04-13","claims":[{"localId":"adaboost-margin-bound","kind":"proposition","title":"AdaBoost Margin Bound","verification":"informal_only","review":"needs_review"},{"localId":"adaboost-training-error-bound","kind":"theorem","title":"AdaBoost Training Error Bound","verification":"informal_only","review":"needs_review"}]},{"topic":"adam-optimizer","url":"https://theorempath.com/topics/adam-optimizer","title":"Adam Optimizer","reviewedOn":"2026-04-25","claims":[{"localId":"adam-bias-correction","kind":"theorem","title":"Bias Correction for Exponential Moving Averages","verification":"informal_only","review":"draft"},{"localId":"adamw-decoupling","kind":"theorem","title":"AdamW Decouples Weight Decay from Gradient Adaptation","verification":"informal_only","review":"needs_review"}]},{"topic":"adaptive-learning-is-not-iid","url":"https://theorempath.com/topics/adaptive-learning-is-not-iid","title":"Adaptive Learning Is Not IID","reviewedOn":"2026-05-02","claims":[{"localId":"adaptive-diagnostic-concentration","kind":"theorem","title":"Adaptive Diagnostic Concentration","verification":"informal_only","review":"needs_review"}]},{"topic":"adaptive-rejection-sampling","url":"https://theorempath.com/topics/adaptive-rejection-sampling","title":"Adaptive Rejection Sampling","reviewedOn":"2026-04-14","claims":[{"localId":"ars-envelope-validity","kind":"theorem","title":"Validity of the ARS Envelope","verification":"informal_only","review":"needs_review"}]},{"topic":"adjoint-sensitivity-method","url":"https://theorempath.com/topics/adjoint-sensitivity-method","title":"Adjoint Sensitivity Method","reviewedOn":"2026-04-17","claims":[{"localId":"adjoint-equation","kind":"theorem","title":"Adjoint Sensitivity for ODEs","verification":"informal_only","review":"draft"}]},{"topic":"adjusted-density-maximization","url":"https://theorempath.com/topics/adjusted-density-maximization","title":"Adjusted Density Maximization","reviewedOn":"2026-04-18","claims":[{"localId":"shrinkage-factor-linearity","kind":"proposition","title":"Conditional Mean and Variance Are Linear in the Shrinkage Factor","verification":"informal_only","review":"draft"}]},{"topic":"adversarial-machine-learning","url":"https://theorempath.com/topics/adversarial-machine-learning","title":"Adversarial Machine Learning","reviewedOn":"2026-04-18","claims":[{"localId":"robustness-accuracy-tradeoff","kind":"proposition","title":"Robustness-Accuracy Tradeoff (pedagogical toy)","verification":"informal_only","review":"needs_review"}]},{"topic":"agent-protocols-mcp-a2a","url":"https://theorempath.com/topics/agent-protocols-mcp-a2a","title":"Agent Protocols: MCP and A2A","reviewedOn":"2026-05-25","claims":[{"localId":"protocol-composability","kind":"proposition","title":"Protocol-Based Composability","verification":"informal_only","review":"needs_review"}]},{"topic":"agentic-rl-and-tool-use","url":"https://theorempath.com/topics/agentic-rl-and-tool-use","title":"Agentic RL and Tool Use","reviewedOn":"2026-05-29","claims":[{"localId":"agent-mdp-formulation","kind":"proposition","title":"LLM Agent as a Markov Decision Process","verification":"informal_only","review":"needs_review"},{"localId":"tool-augmented-policy-gradient","kind":"proposition","title":"Policy Gradient for Tool-Augmented Agents","verification":"informal_only","review":"draft"}]},{"topic":"aic-and-bic","url":"https://theorempath.com/topics/aic-and-bic","title":"AIC and BIC","reviewedOn":"2026-04-26","claims":[{"localId":"aic-loo-equivalence","kind":"proposition","title":"AIC Approximates Leave-One-Out CV","verification":"informal_only","review":"needs_review"}]},{"topic":"alexnet-and-deep-learning-history","url":"https://theorempath.com/topics/alexnet-and-deep-learning-history","title":"AlexNet and Deep Learning History","reviewedOn":"2026-04-14","claims":[{"localId":"alexnet-capacity-bound","kind":"proposition","title":"ReLU Enables Deeper Training","verification":"informal_only","review":"needs_review"}]},{"topic":"algorithmic-stability","url":"https://theorempath.com/topics/algorithmic-stability","title":"Algorithmic Stability","reviewedOn":"2026-05-03","claims":[{"localId":"bousquet-elisseeff-stability-bound","kind":"theorem","title":"Bousquet-Elisseeff: Regularized ERM is Stable","verification":"informal_only","review":"needs_review"},{"localId":"sgd-stability-convex","kind":"theorem","title":"SGD Stability: Smooth Convex Case","verification":"informal_only","review":"needs_review"},{"localId":"uniform-stability-generalization","kind":"theorem","title":"Uniform Stability Implies Generalization","verification":"lean_verified","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"alphaproof-and-ai-theorem-proving","url":"https://theorempath.com/topics/alphaproof-and-ai-theorem-proving","title":"AlphaProof and AI-Assisted Theorem Proving","reviewedOn":"2026-07-12","claims":[{"localId":"kernel-verified-soundness","kind":"proposition","title":"Kernel-Verified Soundness Reduction","verification":"informal_only","review":"needs_review"}]},{"topic":"amd-competition-landscape","url":"https://theorempath.com/topics/amd-competition-landscape","title":"AMD Competition Landscape","reviewedOn":"2026-05-26","claims":[{"localId":"roofline-bandwidth-bound","kind":"proposition","title":"Memory-Bandwidth-Bound Regime","verification":"informal_only","review":"draft"}]},{"topic":"analysis-of-variance","url":"https://theorempath.com/topics/analysis-of-variance","title":"Analysis of Variance","reviewedOn":"2026-05-12","claims":[{"localId":"one-way-anova-f-distribution-null","kind":"theorem","title":"F Distribution of the One-Way ANOVA Statistic Under the Null","verification":"informal_only","review":"needs_review"},{"localId":"one-way-anova-ss-decomposition","kind":"theorem","title":"One-Way ANOVA Sum-of-Squares Decomposition","verification":"informal_only","review":"needs_review"},{"localId":"two-way-anova-decomposition","kind":"theorem","title":"Two-Way ANOVA Sum-of-Squares Decomposition","verification":"informal_only","review":"needs_review"},{"localId":"welch-anova-statistic","kind":"theorem","title":"Welch ANOVA Statistic","verification":"informal_only","review":"draft"}]},{"topic":"anomaly-detection","url":"https://theorempath.com/topics/anomaly-detection","title":"Anomaly Detection","reviewedOn":"2026-04-26","claims":[{"localId":"isolation-forest-path-bound","kind":"proposition","title":"Expected Path Length for Anomalies","verification":"informal_only","review":"needs_review"}]},{"topic":"anthropic-bias-and-observation-selection","url":"https://theorempath.com/topics/anthropic-bias-and-observation-selection","title":"Anthropic Bias and Observation Selection","reviewedOn":"2026-04-14","claims":[{"localId":"doomsday-shift","kind":"proposition","title":"Doomsday Bayesian Shift","verification":"informal_only","review":"draft"}]},{"topic":"anytime-valid-inference","url":"https://theorempath.com/topics/anytime-valid-inference","title":"Anytime-Valid Inference","reviewedOn":"2026-05-13","claims":[{"localId":"anytime-valid-type-i-control","kind":"theorem","title":"Anytime-Valid Type I Error Control","verification":"informal_only","review":"needs_review"}]},{"topic":"arrows-impossibility","url":"https://theorempath.com/topics/arrows-impossibility","title":"Arrow's Impossibility Theorem","reviewedOn":"2026-04-15","claims":[{"localId":"arrows-impossibility-theorem","kind":"theorem","title":"Arrow's Impossibility Theorem","verification":"informal_only","review":"needs_review"},{"localId":"gibbard-satterthwaite","kind":"theorem","title":"Gibbard-Satterthwaite Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"ascent-algorithms","url":"https://theorempath.com/topics/ascent-algorithms","title":"Ascent Algorithms and Hill Climbing","reviewedOn":"2026-04-14","claims":[{"localId":"gradient-ascent-convergence","kind":"theorem","title":"Gradient Ascent Convergence for Smooth Concave Functions","verification":"informal_only","review":"needs_review"},{"localId":"simulated-annealing-convergence","kind":"theorem","title":"Asymptotic Convergence of Simulated Annealing","verification":"informal_only","review":"needs_review"}]},{"topic":"asml-and-chip-manufacturing","url":"https://theorempath.com/topics/asml-and-chip-manufacturing","title":"ASML and Chip Manufacturing","reviewedOn":"2026-05-26","claims":[{"localId":"lithography-resolution-limit","kind":"proposition","title":"Lithography Resolution Scaling","verification":"informal_only","review":"draft"}]},{"topic":"asymptotic-statistics","url":"https://theorempath.com/topics/asymptotic-statistics","title":"Asymptotic Statistics: M-Estimators, Delta Method, LAN","reviewedOn":"2026-04-25","claims":[{"localId":"continuous-mapping-theorem","kind":"theorem","title":"Continuous Mapping Theorem (CMT)","verification":"lean_verified","review":"source_checked","sourceRoles":["proof"]},{"localId":"delta-method","kind":"theorem","title":"Delta Method (univariate and multivariate)","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"lan-theorem","kind":"theorem","title":"Local Asymptotic Normality (Le Cam)","verification":"source_checked","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"m-estimator-asymptotic-normality","kind":"theorem","title":"M-Estimator Asymptotic Normality","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"mle-asymptotic-normality","kind":"corollary","title":"Asymptotic Normality of MLE","verification":"source_checked","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"slutsky-theorem","kind":"theorem","title":"Slutsky's Theorem","verification":"lean_verified","review":"source_checked","sourceRoles":["proof"]},{"localId":"wald-score-lrt-equivalence","kind":"theorem","title":"Asymptotic Equivalence of Wald, Score, and LRT","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"attention-as-kernel-regression","url":"https://theorempath.com/topics/attention-as-kernel-regression","title":"Attention as Kernel Regression","reviewedOn":"2026-04-14","claims":[{"localId":"attention-kernel-equivalence","kind":"proposition","title":"Softmax Attention is Nadaraya-Watson Regression with the Softmax Kernel","verification":"informal_only","review":"needs_review"},{"localId":"random-feature-attention-approximation","kind":"proposition","title":"Random Features Approximate Softmax Attention in Linear Time","verification":"informal_only","review":"needs_review"}]},{"topic":"attention-is-all-you-need-paper","url":"https://theorempath.com/topics/attention-is-all-you-need-paper","title":"Attention Is All You Need (Paper)","reviewedOn":"2026-04-26","claims":[{"localId":"multi-head-attention-capacity","kind":"proposition","title":"Multi-Head Attention Capacity","verification":"informal_only","review":"draft"},{"localId":"self-attention-computation","kind":"proposition","title":"Self-Attention Computational Properties","verification":"informal_only","review":"needs_review"}]},{"topic":"attention-mechanism-theory","url":"https://theorempath.com/topics/attention-mechanism-theory","title":"Attention Mechanism Theory","reviewedOn":"2026-04-26","claims":[{"localId":"attention-as-kernel-smoother","kind":"proposition","title":"Attention as a Kernel Smoother","verification":"informal_only","review":"needs_review"},{"localId":"attention-variance-scaling","kind":"proposition","title":"Scaling Prevents Softmax Saturation","verification":"informal_only","review":"draft"},{"localId":"multi-head-attention-capacity","kind":"proposition","title":"Multi-Head Attention Representational Capacity","verification":"informal_only","review":"needs_review"}]},{"topic":"attention-mechanisms-history","url":"https://theorempath.com/topics/attention-mechanisms-history","title":"Attention Mechanisms History","reviewedOn":"2026-04-14","claims":[{"localId":"attention-as-soft-alignment","kind":"proposition","title":"Attention as Differentiable Soft Alignment","verification":"informal_only","review":"needs_review"}]},{"topic":"attention-sinks-and-retrieval-decay","url":"https://theorempath.com/topics/attention-sinks-and-retrieval-decay","title":"Attention Sinks and Retrieval Decay","reviewedOn":"2026-06-04","claims":[{"localId":"attention-sink-concentration","kind":"proposition","title":"Attention Sink Concentration","verification":"informal_only","review":"needs_review"}]},{"topic":"attention-variants-and-efficiency","url":"https://theorempath.com/topics/attention-variants-and-efficiency","title":"Attention Variants and Efficiency","reviewedOn":"2026-04-26","claims":[{"localId":"linear-attention-kernel-equivalence","kind":"proposition","title":"Linear Attention as Kernel Approximation","verification":"informal_only","review":"needs_review"},{"localId":"mha-expressivity-advantage","kind":"proposition","title":"Multi-Head Expressivity","verification":"informal_only","review":"needs_review"}]},{"topic":"auction-theory","url":"https://theorempath.com/topics/auction-theory","title":"Auction Theory","reviewedOn":"2026-04-26","claims":[{"localId":"first-price-equilibrium","kind":"proposition","title":"Symmetric Equilibrium in First-Price Auctions","verification":"informal_only","review":"needs_review"},{"localId":"revenue-equivalence-theorem","kind":"theorem","title":"Revenue Equivalence Theorem","verification":"informal_only","review":"draft"},{"localId":"vickrey-truthfulness","kind":"theorem","title":"Truthful Bidding in Vickrey Auctions","verification":"informal_only","review":"needs_review"}]},{"topic":"audio-language-models","url":"https://theorempath.com/topics/audio-language-models","title":"Audio Language Models","reviewedOn":"2026-05-29","claims":[{"localId":"audio-tokenization-tradeoff","kind":"proposition","title":"Audio Token Rate-Quality Tradeoff","verification":"informal_only","review":"draft"},{"localId":"pipeline-vs-end-to-end-latency","kind":"proposition","title":"Pipeline vs End-to-End Latency Decomposition","verification":"informal_only","review":"draft"}]},{"topic":"augmented-lagrangian-and-admm","url":"https://theorempath.com/topics/augmented-lagrangian-and-admm","title":"Augmented Lagrangian and ADMM","reviewedOn":"2026-04-25","claims":[{"localId":"admm-convergence","kind":"theorem","title":"Two-Block Convex ADMM Convergence","verification":"informal_only","review":"needs_review"},{"localId":"method-of-multipliers-convergence","kind":"theorem","title":"Method Of Multipliers Convergence","verification":"informal_only","review":"needs_review"}]},{"topic":"autoencoders","url":"https://theorempath.com/topics/autoencoders","title":"Autoencoders","reviewedOn":"2026-04-27","claims":[{"localId":"linear-autoencoder-pca","kind":"theorem","title":"Linear Autoencoders Recover PCA","verification":"informal_only","review":"needs_review"}]},{"topic":"automatic-differentiation","url":"https://theorempath.com/topics/automatic-differentiation","title":"Automatic Differentiation","reviewedOn":"2026-04-26","claims":[{"localId":"forward-mode-complexity","kind":"proposition","title":"Forward Mode Efficiency for Low-Dimensional Inputs","verification":"informal_only","review":"needs_review"},{"localId":"reverse-mode-complexity","kind":"theorem","title":"Reverse Mode Computes All Gradients in O(1) Backward Passes","verification":"informal_only","review":"needs_review"}]},{"topic":"b-splines","url":"https://theorempath.com/topics/b-splines","title":"B-Splines","reviewedOn":"2026-05-13","claims":[{"localId":"b-spline-partition-of-unity","kind":"proposition","title":"Partition of Unity for B-Splines","verification":"informal_only","review":"needs_review"}]},{"topic":"backward-sde-theory","url":"https://theorempath.com/topics/backward-sde-theory","title":"Backward Stochastic Differential Equations","reviewedOn":"2026-04-18","claims":[{"localId":"nonlinear-feynman-kac-pardoux-peng-1992","kind":"theorem","title":"Nonlinear Feynman–Kac (Pardoux–Peng 1992)","verification":"informal_only","review":"draft"},{"localId":"pardoux-peng-existence-uniqueness","kind":"theorem","title":"Pardoux–Peng Existence and Uniqueness Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"bagging","url":"https://theorempath.com/topics/bagging","title":"Bagging","reviewedOn":"2026-04-26","claims":[{"localId":"bagging-variance-reduction-bound","kind":"theorem","title":"Variance of Averaged Estimators","verification":"informal_only","review":"needs_review"}]},{"topic":"base-rate-fallacy","url":"https://theorempath.com/topics/base-rate-fallacy","title":"Base Rate Fallacy","reviewedOn":"2026-04-13","claims":[{"localId":"positive-predictive-value-theorem","kind":"theorem","title":"Positive Predictive Value via Bayes Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"basic-logic-and-proof-techniques","url":"https://theorempath.com/topics/basic-logic-and-proof-techniques","title":"Basic Logic and Proof Techniques","reviewedOn":"2026-04-25","claims":[{"localId":"principle-of-mathematical-induction","kind":"theorem","title":"Principle Of Mathematical Induction","verification":"informal_only","review":"needs_review"}]},{"topic":"basu-theorem","url":"https://theorempath.com/topics/basu-theorem","title":"Basu's Theorem","reviewedOn":"2026-04-26","claims":[{"localId":"basu-theorem-statement","kind":"theorem","title":"Basu's Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"batch-normalization","url":"https://theorempath.com/topics/batch-normalization","title":"Batch Normalization","reviewedOn":"2026-04-26","claims":[{"localId":"bn-smoothing-theorem","kind":"proposition","title":"BN Smooths the Loss Landscape","verification":"informal_only","review":"needs_review"}]},{"topic":"batch-size-and-learning-dynamics","url":"https://theorempath.com/topics/batch-size-and-learning-dynamics","title":"Batch Size and Learning Dynamics","reviewedOn":"2026-04-18","claims":[{"localId":"gradient-noise-scale-theorem","kind":"proposition","title":"Critical Batch Size and Training Efficiency","verification":"informal_only","review":"needs_review"},{"localId":"linear-scaling-rule","kind":"proposition","title":"Linear Scaling Rule","verification":"informal_only","review":"draft"},{"localId":"small-batch-flat-minima","kind":"proposition","title":"Small Batch SGD Favors Flat Minima","verification":"informal_only","review":"needs_review"}]},{"topic":"bayesian-estimation","url":"https://theorempath.com/topics/bayesian-estimation","title":"Bayesian Estimation","reviewedOn":"2026-07-03","claims":[{"localId":"bernstein-von-mises-theorem","kind":"theorem","title":"Bernstein-von Mises Theorem","verification":"informal_only","review":"needs_review"},{"localId":"conjugate-posterior-update","kind":"proposition","title":"Conjugate Prior Updates","verification":"informal_only","review":"needs_review"}]},{"topic":"bayesian-linear-regression","url":"https://theorempath.com/topics/bayesian-linear-regression","title":"Bayesian Linear Regression","reviewedOn":"2026-05-10","claims":[{"localId":"blr-marginal-likelihood","kind":"theorem","title":"Marginal Likelihood for Bayesian Linear Regression","verification":"informal_only","review":"needs_review"},{"localId":"blr-posterior-derivation","kind":"theorem","title":"Posterior in Bayesian Linear Regression","verification":"informal_only","review":"needs_review"},{"localId":"blr-predictive-distribution","kind":"theorem","title":"Predictive Distribution in Bayesian Linear Regression","verification":"informal_only","review":"needs_review"}]},{"topic":"bayesian-neural-networks","url":"https://theorempath.com/topics/bayesian-neural-networks","title":"Bayesian Neural Networks","reviewedOn":"2026-04-14","claims":[{"localId":"bnn-posterior-intractability","kind":"proposition","title":"Posterior Intractability for Neural Networks","verification":"informal_only","review":"needs_review"},{"localId":"mc-dropout-variational","kind":"proposition","title":"MC Dropout as Variational Inference","verification":"informal_only","review":"draft"}]},{"topic":"bayesian-optimization-for-hyperparameters","url":"https://theorempath.com/topics/bayesian-optimization-for-hyperparameters","title":"Bayesian Optimization for Hyperparameters","reviewedOn":"2026-04-23","claims":[{"localId":"ei-closed-form","kind":"proposition","title":"Expected Improvement Closed Form","verification":"informal_only","review":"needs_review"},{"localId":"gp-ucb-regret-bound","kind":"theorem","title":"GP-UCB Cumulative Regret Bound","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"bayesian-state-estimation","url":"https://theorempath.com/topics/bayesian-state-estimation","title":"Bayesian State Estimation","reviewedOn":"2026-04-14","claims":[{"localId":"bayes-filter-recursion","kind":"theorem","title":"Bayes Filter Recursion","verification":"informal_only","review":"needs_review"},{"localId":"kalman-filter-update","kind":"theorem","title":"Kalman Filter","verification":"informal_only","review":"needs_review"}]},{"topic":"bellman-equations","url":"https://theorempath.com/topics/bellman-equations","title":"Bellman Equations","reviewedOn":"2026-04-15","claims":[{"localId":"bellman-expectation-contraction","kind":"proposition","title":"Bellman Expectation Operator Contraction","verification":"informal_only","review":"needs_review"},{"localId":"bellman-optimality-contraction","kind":"theorem","title":"Bellman Optimality Operator is a Gamma-Contraction","verification":"informal_only","review":"needs_review"}]},{"topic":"benchmarking-methodology","url":"https://theorempath.com/topics/benchmarking-methodology","title":"Benchmarking Methodology","reviewedOn":"2026-04-13","claims":[{"localId":"benchmark-validity-criteria","kind":"proposition","title":"Benchmark Validity Criteria","verification":"informal_only","review":"needs_review"}]},{"topic":"benfords-law","url":"https://theorempath.com/topics/benfords-law","title":"Benford's Law","reviewedOn":"2026-04-14","claims":[{"localId":"benfords-law-statement","kind":"proposition","title":"Benfords Law","verification":"informal_only","review":"needs_review"},{"localId":"scale-invariance-characterization","kind":"theorem","title":"Scale Invariance Characterization","verification":"informal_only","review":"needs_review"}]},{"topic":"benign-overfitting","url":"https://theorempath.com/topics/benign-overfitting","title":"Benign Overfitting","reviewedOn":"2026-04-26","claims":[{"localId":"benign-overfitting-linear","kind":"theorem","title":"Benign Overfitting in Linear Regression","verification":"informal_only","review":"needs_review"},{"localId":"effective-rank-condition","kind":"proposition","title":"Variance Effective Rank Determines Benign vs Catastrophic","verification":"informal_only","review":"needs_review"}]},{"topic":"bennetts-inequality","url":"https://theorempath.com/topics/bennetts-inequality","title":"Bennett's Inequality","reviewedOn":"2026-05-08","claims":[{"localId":"bennetts-inequality","kind":"theorem","title":"Bennett's Inequality","verification":"informal_only","review":"needs_review"},{"localId":"bernstein-from-bennett","kind":"corollary","title":"Bernstein's Inequality from Bennett","verification":"informal_only","review":"needs_review"}]},{"topic":"bernstein-inequality","url":"https://theorempath.com/topics/bernstein-inequality","title":"Bernstein Inequality","reviewedOn":"2026-05-04","claims":[{"localId":"bernstein-sample-mean-bound","kind":"corollary","title":"Bernstein Bound for a Sample Mean","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"empirical-bernstein-inequality","kind":"theorem","title":"Empirical Bernstein Inequality (Maurer-Pontil 2009)","verification":"informal_only","review":"needs_review"},{"localId":"scalar-bernstein-inequality","kind":"theorem","title":"Scalar Bernstein Inequality","verification":"source_checked","review":"source_checked","sourceRoles":["background","proof"]}]},{"topic":"bert-and-pretrain-finetune-paradigm","url":"https://theorempath.com/topics/bert-and-pretrain-finetune-paradigm","title":"BERT and the Pretrain-Finetune Paradigm","reviewedOn":"2026-04-14","claims":[{"localId":"pretrain-finetune-transfer-bound","kind":"proposition","title":"Transfer Learning via Pretrained Representations","verification":"informal_only","review":"needs_review"}]},{"topic":"beta-distribution","url":"https://theorempath.com/topics/beta-distribution","title":"Beta Distribution","reviewedOn":"2026-05-11","claims":[{"localId":"beta-as-uniform-order-statistic","kind":"theorem","title":"Order Statistics of Uniforms Are Beta","verification":"informal_only","review":"draft"},{"localId":"beta-density-and-moments","kind":"proposition","title":"Beta Mean and Variance","verification":"informal_only","review":"needs_review"},{"localId":"beta-posterior-for-bernoulli","kind":"theorem","title":"Beta-Bernoulli Conjugacy","verification":"informal_only","review":"draft"}]},{"topic":"bias-complexity-tradeoff","url":"https://theorempath.com/topics/bias-complexity-tradeoff","title":"Bias-Complexity Tradeoff","reviewedOn":"2026-05-08","claims":[{"localId":"erm-error-decomposition","kind":"theorem","title":"ERM Error Decomposition (Shalev-Shwartz and Ben-David, Section 5.2)","verification":"informal_only","review":"needs_review"}]},{"topic":"bias-variance-tradeoff","url":"https://theorempath.com/topics/bias-variance-tradeoff","title":"Bias-Variance Tradeoff","reviewedOn":"2026-04-26","claims":[{"localId":"bias-variance-decomposition","kind":"theorem","title":"Bias-Variance Decomposition of MSE","verification":"informal_only","review":"needs_review"},{"localId":"knn-bias-variance","kind":"proposition","title":"Bias-Variance for K-Nearest Neighbors","verification":"informal_only","review":"needs_review"}]},{"topic":"birthday-paradox","url":"https://theorempath.com/topics/birthday-paradox","title":"Birthday Paradox","reviewedOn":"2026-04-13","claims":[{"localId":"birthday-collision-probability","kind":"theorem","title":"Birthday Collision Threshold","verification":"informal_only","review":"needs_review"}]},{"topic":"bits-nats-perplexity-bpb","url":"https://theorempath.com/topics/bits-nats-perplexity-bpb","title":"Bits, Nats, Perplexity, and BPB","reviewedOn":"2026-04-18","claims":[{"localId":"unit-conversion-identities","kind":"proposition","title":"Unit Conversion Identities","verification":"informal_only","review":"draft"}]},{"topic":"bitter-lesson","url":"https://theorempath.com/topics/bitter-lesson","title":"The Bitter Lesson","reviewedOn":"2026-04-15","claims":[{"localId":"bitter-lesson-principle","kind":"proposition","title":"Scaling-Law Consequence of Power-Law Loss","verification":"informal_only","review":"needs_review"}]},{"topic":"boltzmann-machines-and-hopfield-networks","url":"https://theorempath.com/topics/boltzmann-machines-and-hopfield-networks","title":"Boltzmann Machines and Hopfield Networks","reviewedOn":"2026-04-14","claims":[{"localId":"hopfield-convergence","kind":"theorem","title":"Hopfield Convergence Theorem","verification":"informal_only","review":"needs_review"},{"localId":"rbm-contrastive-divergence","kind":"proposition","title":"Contrastive Divergence Approximation","verification":"informal_only","review":"needs_review"}]},{"topic":"bootstrap-methods","url":"https://theorempath.com/topics/bootstrap-methods","title":"Bootstrap Methods","reviewedOn":"2026-04-13","claims":[{"localId":"bootstrap-consistency","kind":"theorem","title":"Bootstrap Consistency","verification":"informal_only","review":"needs_review"}]},{"topic":"borel-cantelli-lemmas","url":"https://theorempath.com/topics/borel-cantelli-lemmas","title":"Borel-Cantelli Lemmas","reviewedOn":"2026-04-26","claims":[{"localId":"first-borel-cantelli","kind":"lemma","title":"First Borel-Cantelli Lemma","verification":"informal_only","review":"needs_review"},{"localId":"second-borel-cantelli","kind":"lemma","title":"Second Borel-Cantelli Lemma","verification":"informal_only","review":"needs_review"}]},{"topic":"bounded-rationality","url":"https://theorempath.com/topics/bounded-rationality","title":"Bounded Rationality","reviewedOn":"2026-04-26","claims":[{"localId":"satisficing-threshold","kind":"theorem","title":"Optimal Satisficing Threshold","verification":"informal_only","review":"needs_review"}]},{"topic":"burn-in-convergence-diagnostics","url":"https://theorempath.com/topics/burn-in-convergence-diagnostics","title":"Burn-in and Convergence Diagnostics","reviewedOn":"2026-04-25","claims":[{"localId":"gelman-rubin-diagnostic","kind":"proposition","title":"Classical Gelman-Rubin R-hat Diagnostic","verification":"informal_only","review":"needs_review"}]},{"topic":"byte-level-language-models","url":"https://theorempath.com/topics/byte-level-language-models","title":"Byte-Level Language Models","reviewedOn":"2026-05-27","claims":[{"localId":"byte-compute-ratio","kind":"proposition","title":"Compute Ratio: Byte-Level vs. Subword","verification":"informal_only","review":"needs_review"}]},{"topic":"calibration-and-uncertainty","url":"https://theorempath.com/topics/calibration-and-uncertainty","title":"Calibration and Uncertainty Quantification","reviewedOn":"2026-04-25","claims":[{"localId":"conformal-coverage-guarantee","kind":"theorem","title":"Split Conformal Coverage Guarantee","verification":"informal_only","review":"needs_review"},{"localId":"platt-scaling-calibration","kind":"proposition","title":"Platt Scaling Calibration","verification":"informal_only","review":"draft"}]},{"topic":"cantors-theorem-and-uncountability","url":"https://theorempath.com/topics/cantors-theorem-and-uncountability","title":"Cantor's Theorem and Uncountability","reviewedOn":"2026-04-13","claims":[{"localId":"cantors-theorem","kind":"theorem","title":"Cantor's Theorem","verification":"informal_only","review":"needs_review"},{"localId":"uncountability-of-reals","kind":"theorem","title":"Uncountability of the Reals","verification":"informal_only","review":"needs_review"}]},{"topic":"cap-theorem","url":"https://theorempath.com/topics/cap-theorem","title":"CAP Theorem","reviewedOn":"2026-04-15","claims":[{"localId":"cap-impossibility","kind":"theorem","title":"CAP Impossibility Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"cardinality-and-countability","url":"https://theorempath.com/topics/cardinality-and-countability","title":"Cardinality and Countability","reviewedOn":"2026-04-14","claims":[{"localId":"cantor-diagonal-uncountability","kind":"theorem","title":"Uncountability of the Reals","verification":"informal_only","review":"needs_review"},{"localId":"cantor-power-set","kind":"theorem","title":"Cantor's Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"catastrophic-forgetting","url":"https://theorempath.com/topics/catastrophic-forgetting","title":"Catastrophic Forgetting","reviewedOn":"2026-04-18","claims":[{"localId":"ewc-objective","kind":"proposition","title":"Elastic Weight Consolidation","verification":"informal_only","review":"needs_review"}]},{"topic":"category-theory","url":"https://theorempath.com/topics/category-theory","title":"Category Theory","reviewedOn":"2026-04-15","claims":[{"localId":"yoneda-lemma","kind":"lemma","title":"Yoneda Lemma","verification":"informal_only","review":"needs_review"}]},{"topic":"causal-inference-basics","url":"https://theorempath.com/topics/causal-inference-basics","title":"Causal Inference Basics","reviewedOn":"2026-04-23","claims":[{"localId":"identification-of-ate","kind":"theorem","title":"Identification of the ATE Under Ignorability","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"propensity-score-theorem","kind":"theorem","title":"Rosenbaum-Rubin Propensity Score Theorem","verification":"informal_only","review":"draft"}]},{"topic":"causal-inference-pearl","url":"https://theorempath.com/topics/causal-inference-pearl","title":"Causal Inference and the Ladder of Causation","reviewedOn":"2026-04-17","claims":[{"localId":"backdoor-criterion","kind":"theorem","title":"Backdoor Criterion and Adjustment Formula","verification":"informal_only","review":"needs_review"}]},{"topic":"central-limit-theorem","url":"https://theorempath.com/topics/central-limit-theorem","title":"Central Limit Theorem","reviewedOn":"2026-08-01","claims":[{"localId":"berry-esseen-bound","kind":"theorem","title":"Berry-Esseen Theorem","verification":"informal_only","review":"needs_review"},{"localId":"classical-clt","kind":"theorem","title":"Classical Central Limit Theorem (Lindeberg-Levy)","verification":"informal_only","review":"needs_review"},{"localId":"delta-method-clt","kind":"theorem","title":"Delta Method","verification":"informal_only","review":"needs_review"},{"localId":"lindeberg-feller-clt","kind":"theorem","title":"Lindeberg-Feller CLT","verification":"informal_only","review":"needs_review"},{"localId":"martingale-clt","kind":"theorem","title":"Martingale CLT (Brown 1971 / McLeish 1974)","verification":"informal_only","review":"needs_review"},{"localId":"multivariate-clt","kind":"theorem","title":"Multivariate CLT","verification":"informal_only","review":"needs_review"}]},{"topic":"chain-of-thought-and-reasoning","url":"https://theorempath.com/topics/chain-of-thought-and-reasoning","title":"Chain-of-Thought and Reasoning","reviewedOn":"2026-07-11","claims":[{"localId":"cot-decomposition-principle","kind":"proposition","title":"CoT as Problem Decomposition","verification":"informal_only","review":"draft"},{"localId":"cot-expressiveness-hierarchy","kind":"theorem","title":"CoT Expressiveness Hierarchy (Merrill-Sabharwal)","verification":"informal_only","review":"needs_review"},{"localId":"cot-faithfulness-gap","kind":"proposition","title":"The CoT Faithfulness Gap","verification":"informal_only","review":"needs_review"},{"localId":"self-consistency-majority-vote","kind":"proposition","title":"Self-Consistency Improves Over Single CoT","verification":"informal_only","review":"draft"}]},{"topic":"characteristic-functions","url":"https://theorempath.com/topics/characteristic-functions","title":"Characteristic Functions","reviewedOn":"2026-04-26","claims":[{"localId":"bochner-theorem","kind":"theorem","title":"Bochner's Theorem","verification":"informal_only","review":"needs_review"},{"localId":"characteristic-function-uniqueness","kind":"theorem","title":"Uniqueness Theorem for Characteristic Functions","verification":"informal_only","review":"needs_review"},{"localId":"levy-continuity-theorem","kind":"theorem","title":"Levy's Continuity Theorem","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"chernoff-bounds","url":"https://theorempath.com/topics/chernoff-bounds","title":"Chernoff Bounds","reviewedOn":"2026-04-23","claims":[{"localId":"azuma-hoeffding","kind":"theorem","title":"Azuma-Hoeffding Inequality","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"bernstein-inequality","kind":"theorem","title":"Bernstein's Inequality","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"chernoff-method","kind":"theorem","title":"The Chernoff Method (General Upper Tail)","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"multiplicative-chernoff-bound","kind":"theorem","title":"Multiplicative Chernoff Bound","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"chi-squared-concentration","url":"https://theorempath.com/topics/chi-squared-concentration","title":"Chi-Squared Concentration","reviewedOn":"2026-05-08","claims":[{"localId":"chi-squared-lower-tail","kind":"theorem","title":"Chi-Squared Lower Tail","verification":"informal_only","review":"needs_review"},{"localId":"chi-squared-two-sided","kind":"theorem","title":"Chi-Squared Two-Sided Bound","verification":"informal_only","review":"needs_review"},{"localId":"chi-squared-upper-tail","kind":"theorem","title":"Chi-Squared Upper Tail","verification":"informal_only","review":"needs_review"}]},{"topic":"chi-squared-distribution-and-tests","url":"https://theorempath.com/topics/chi-squared-distribution-and-tests","title":"Chi-Squared Distribution and Tests","reviewedOn":"2026-05-11","claims":[{"localId":"chi-squared-as-sum-of-squared-normals","kind":"theorem","title":"Sum of Squared Normals","verification":"informal_only","review":"needs_review"},{"localId":"chi-squared-independence-test","kind":"theorem","title":"Pearson Chi-Squared Test of Independence","verification":"informal_only","review":"needs_review"},{"localId":"pearson-chi-squared-gof","kind":"theorem","title":"Pearson Chi-Squared Goodness of Fit","verification":"informal_only","review":"needs_review"},{"localId":"sample-variance-distribution","kind":"theorem","title":"Sample Variance Distribution for Normal Data","verification":"informal_only","review":"needs_review"}]},{"topic":"class-imbalance-and-resampling","url":"https://theorempath.com/topics/class-imbalance-and-resampling","title":"Class Imbalance and Resampling","reviewedOn":"2026-04-26","claims":[{"localId":"accuracy-paradox","kind":"proposition","title":"Accuracy Paradox for Imbalanced Classes","verification":"informal_only","review":"needs_review"}]},{"topic":"classical-odes","url":"https://theorempath.com/topics/classical-odes","title":"Classical ODEs: Existence, Stability, and Numerical Methods","reviewedOn":"2026-04-17","claims":[{"localId":"gronwall-inequality","kind":"lemma","title":"Gronwall's Inequality (Differential Form)","verification":"informal_only","review":"needs_review"},{"localId":"lyapunov-stability","kind":"theorem","title":"Lyapunov's Direct Method","verification":"informal_only","review":"needs_review"},{"localId":"picard-lindelof","kind":"theorem","title":"Picard-Lindelof Existence and Uniqueness","verification":"informal_only","review":"needs_review"}]},{"topic":"claude-model-family","url":"https://theorempath.com/topics/claude-model-family","title":"Claude Model Family","reviewedOn":"2026-07-30","claims":[{"localId":"constitutional-ai-training-signal","kind":"proposition","title":"CAI Training Signal Construction","verification":"informal_only","review":"draft"}]},{"topic":"clip-and-openclip-in-practice","url":"https://theorempath.com/topics/clip-and-openclip-in-practice","title":"CLIP, OpenCLIP, and SigLIP: Contrastive Language-Image Pretraining","reviewedOn":"2026-04-19","claims":[{"localId":"clip-contrastive-objective","kind":"proposition","title":"CLIP Symmetric Contrastive Loss","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"infonce-mutual-information-bound","kind":"theorem","title":"InfoNCE is a Lower Bound on Mutual Information","verification":"informal_only","review":"needs_review"},{"localId":"modality-gap-phenomenon","kind":"proposition","title":"Modality Gap (Liang et al. 2022)","verification":"informal_only","review":"needs_review"},{"localId":"openclip-scaling-laws","kind":"proposition","title":"OpenCLIP Scaling Laws (Cherti et al. 2023)","verification":"informal_only","review":"draft"},{"localId":"siglip-pairwise-sigmoid","kind":"proposition","title":"SigLIP Pairwise Sigmoid Loss (Zhai et al. 2023)","verification":"informal_only","review":"needs_review"}]},{"topic":"cohere-models","url":"https://theorempath.com/topics/cohere-models","title":"Cohere Models","reviewedOn":"2026-05-31","claims":[{"localId":"sovereign-ai-frame","kind":"proposition","title":"Sovereign AI Is About Control, Not Quality","verification":"informal_only","review":"needs_review"}]},{"topic":"common-inequalities","url":"https://theorempath.com/topics/common-inequalities","title":"Common Inequalities","reviewedOn":"2026-04-26","claims":[{"localId":"cauchy-schwarz-inequality","kind":"theorem","title":"Cauchy-Schwarz Inequality","verification":"lean_verified","review":"source_checked","sourceRoles":["proof"]},{"localId":"jensen-inequality","kind":"theorem","title":"Jensen Inequality","verification":"lean_verified","review":"needs_review"}]},{"topic":"common-probability-distributions","url":"https://theorempath.com/topics/common-probability-distributions","title":"Common Probability Distributions","reviewedOn":"2026-04-23","claims":[{"localId":"gaussian-pdf-derivation","kind":"proposition","title":"The Gaussian Normalizing Constant","verification":"informal_only","review":"needs_review"}]},{"topic":"commons-governance-ostrom","url":"https://theorempath.com/topics/commons-governance-ostrom","title":"Commons Governance and Institutional Analysis","reviewedOn":"2026-04-15","claims":[{"localId":"ostrom-design-principles","kind":"theorem","title":"Design Principles for Durable Commons Institutions","verification":"informal_only","review":"needs_review"}]},{"topic":"compactness-and-heine-borel","url":"https://theorempath.com/topics/compactness-and-heine-borel","title":"Compactness and Heine-Borel","reviewedOn":"2026-04-18","claims":[{"localId":"extreme-value-theorem","kind":"theorem","title":"Extreme Value Theorem","verification":"informal_only","review":"needs_review"},{"localId":"heine-borel-theorem","kind":"theorem","title":"Heine-Borel Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"computer-architecture-for-ml","url":"https://theorempath.com/topics/computer-architecture-for-ml","title":"Computer Architecture for ML","reviewedOn":"2026-04-15","claims":[{"localId":"roofline-bound","kind":"proposition","title":"Roofline Performance Bound","verification":"informal_only","review":"draft"}]},{"topic":"concentration-inequalities","url":"https://theorempath.com/topics/concentration-inequalities","title":"Concentration Inequalities","reviewedOn":"2026-08-01","claims":[{"localId":"bernstein-inequality","kind":"theorem","title":"Bernstein's Inequality","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"chebyshev-inequality","kind":"theorem","title":"Chebyshev's Inequality","verification":"lean_verified","review":"source_checked","sourceRoles":["proof"]},{"localId":"chebyshev-sample-mean","kind":"lemma","title":"Lemma B.2: Chebyshev for the sample mean","verification":"informal_only","review":"draft"},{"localId":"hoeffding-inequality","kind":"theorem","title":"Hoeffding's Inequality","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"hoeffding-one-sided-finite-sum","kind":"theorem","title":"Hoeffding One-Sided Finite-Sum Bound","verification":"lean_verified","review":"source_checked","sourceRoles":["proof"]},{"localId":"markov-inequality","kind":"theorem","title":"Markov's Inequality","verification":"lean_verified","review":"source_checked","sourceRoles":["proof"]},{"localId":"markov-lower-tail-bounded","kind":"lemma","title":"Lemma B.1: Lower-tail bound for [0,1]-valued variables","verification":"informal_only","review":"needs_review"},{"localId":"sub-gaussian-sum-tail-bound","kind":"lemma","title":"Sub-Gaussian Finite-Sum Tail Bound","verification":"lean_verified","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"conditioning-and-condition-number","url":"https://theorempath.com/topics/conditioning-and-condition-number","title":"Conditioning and Condition Number","reviewedOn":"2026-04-26","claims":[{"localId":"perturbation-bound-linear-systems","kind":"theorem","title":"Relative Perturbation Bound for Ax = b","verification":"informal_only","review":"needs_review"}]},{"topic":"confidence-sequences","url":"https://theorempath.com/topics/confidence-sequences","title":"Confidence Sequences","reviewedOn":"2026-05-13","claims":[{"localId":"confidence-sequence-via-e-process-inversion","kind":"theorem","title":"Confidence Sequence via E-Process Inversion","verification":"informal_only","review":"needs_review"}]},{"topic":"confusion-matrices-and-classification-metrics","url":"https://theorempath.com/topics/confusion-matrices-and-classification-metrics","title":"Confusion Matrices and Classification Metrics","reviewedOn":"2026-04-13","claims":[{"localId":"f1-harmonic-mean-theorem","kind":"proposition","title":"F1 as Harmonic Mean","verification":"informal_only","review":"needs_review"},{"localId":"roc-auc-ranking-theorem","kind":"theorem","title":"AUC as Ranking Probability","verification":"informal_only","review":"draft"}]},{"topic":"confusion-matrix-deep-dive","url":"https://theorempath.com/topics/confusion-matrix-deep-dive","title":"Confusion Matrix: MCC, Kappa, and Cost-Sensitive Evaluation","reviewedOn":"2026-04-26","claims":[{"localId":"mcc-geometric-mean","kind":"proposition","title":"MCC as Geometric Mean of Regression Coefficients","verification":"informal_only","review":"needs_review"}]},{"topic":"conjugate-gradient-methods","url":"https://theorempath.com/topics/conjugate-gradient-methods","title":"Conjugate Gradient Methods","reviewedOn":"2026-04-25","claims":[{"localId":"cg-convergence-rate","kind":"theorem","title":"Condition-Number Convergence Bound","verification":"informal_only","review":"needs_review"},{"localId":"cg-finite-termination","kind":"theorem","title":"Finite Termination In Exact Arithmetic","verification":"informal_only","review":"needs_review"},{"localId":"cg-variational-characterization","kind":"theorem","title":"CG Variational Characterization","verification":"informal_only","review":"needs_review"}]},{"topic":"conjugate-priors","url":"https://theorempath.com/topics/conjugate-priors","title":"Conjugate Priors","reviewedOn":"2026-05-10","claims":[{"localId":"conjugacy-from-exponential-family","kind":"theorem","title":"Conjugate Prior for an Exponential-Family Likelihood","verification":"informal_only","review":"needs_review"}]},{"topic":"context-engineering","url":"https://theorempath.com/topics/context-engineering","title":"Context Engineering","reviewedOn":"2026-05-25","claims":[{"localId":"lost-in-the-middle","kind":"proposition","title":"Lost in the Middle","verification":"informal_only","review":"draft"}]},{"topic":"continual-learning-and-forgetting","url":"https://theorempath.com/topics/continual-learning-and-forgetting","title":"Continual Learning and Forgetting","reviewedOn":"2026-04-14","claims":[{"localId":"ewc-loss-theorem","kind":"theorem","title":"EWC Objective via Laplace Approximation","verification":"informal_only","review":"needs_review"},{"localId":"replay-convergence","kind":"proposition","title":"Replay Buffer Convergence","verification":"informal_only","review":"needs_review"}]},{"topic":"continuity-in-rn","url":"https://theorempath.com/topics/continuity-in-rn","title":"Continuity in Rⁿ","reviewedOn":"2026-04-26","claims":[{"localId":"extreme-value-theorem","kind":"theorem","title":"Extreme Value Theorem","verification":"informal_only","review":"needs_review"},{"localId":"heine-cantor-theorem","kind":"theorem","title":"Heine-Cantor Theorem","verification":"informal_only","review":"draft"}]},{"topic":"continuous-normalizing-flows","url":"https://theorempath.com/topics/continuous-normalizing-flows","title":"Continuous Normalizing Flows","reviewedOn":"2026-05-25","claims":[{"localId":"ffjord-trace-estimator","kind":"proposition","title":"Hutchinson Trace Estimator for CNFs","verification":"informal_only","review":"needs_review"},{"localId":"instantaneous-change-of-variables","kind":"theorem","title":"Instantaneous Change of Variables","verification":"informal_only","review":"needs_review"}]},{"topic":"continuous-thought-machines","url":"https://theorempath.com/topics/continuous-thought-machines","title":"Continuous Thought Machines","reviewedOn":"2026-05-25","claims":[{"localId":"continuous-thought-formulation","kind":"proposition","title":"Continuous Thought Machine","verification":"informal_only","review":"needs_review"}]},{"topic":"continuous-time-gradient-flow-slt","url":"https://theorempath.com/topics/continuous-time-gradient-flow-slt","title":"Continuous-Time Gradient Flow (SLT View)","reviewedOn":"2026-05-13","claims":[{"localId":"gradient-flow-ls-min-norm","kind":"theorem","title":"Gradient Flow on Least Squares Converges to Minimum-Norm OLS","verification":"informal_only","review":"needs_review"},{"localId":"gradient-flow-ridge-equivalence","kind":"theorem","title":"Gradient Flow at Time t Equals Ridge at Specific Lambda(t)","verification":"informal_only","review":"needs_review"}]},{"topic":"contraction-inequality","url":"https://theorempath.com/topics/contraction-inequality","title":"Contraction Inequality","reviewedOn":"2026-04-22","claims":[{"localId":"contraction-inequality-main","kind":"theorem","title":"Contraction Inequality (Ledoux-Talagrand)","verification":"informal_only","review":"needs_review"},{"localId":"vector-contraction","kind":"proposition","title":"Vector-Valued Contraction","verification":"informal_only","review":"draft"}]},{"topic":"contrastive-learning","url":"https://theorempath.com/topics/contrastive-learning","title":"Contrastive Learning","reviewedOn":"2026-04-26","claims":[{"localId":"contrastive-uniform-alignment","kind":"proposition","title":"Alignment and Uniformity Decomposition","verification":"informal_only","review":"draft"},{"localId":"infonce-mi-bound","kind":"theorem","title":"InfoNCE as Mutual Information Lower Bound","verification":"informal_only","review":"needs_review"}]},{"topic":"convex-duality","url":"https://theorempath.com/topics/convex-duality","title":"Convex Duality","reviewedOn":"2026-04-18","claims":[{"localId":"fenchel-moreau-theorem","kind":"theorem","title":"Fenchel-Moreau Biconjugation Theorem","verification":"informal_only","review":"needs_review"},{"localId":"strong-duality-slater","kind":"theorem","title":"Strong Duality via Slater's Condition","verification":"informal_only","review":"needs_review"}]},{"topic":"convex-optimization-basics","url":"https://theorempath.com/topics/convex-optimization-basics","title":"Convex Optimization Basics","reviewedOn":"2026-07-03","claims":[{"localId":"gd-smooth-convex-convergence","kind":"theorem","title":"GD Convergence for Smooth Convex Functions","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"gd-strong-convex-convergence","kind":"theorem","title":"GD Convergence for Smooth and Strongly Convex Functions","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"convex-tinkering","url":"https://theorempath.com/topics/convex-tinkering","title":"Convex Tinkering","reviewedOn":"2026-04-26","claims":[{"localId":"convex-payoff-inequality","kind":"theorem","title":"Jensen's Inequality for Average Research Payoffs","verification":"informal_only","review":"needs_review"},{"localId":"optionality-via-max","kind":"proposition","title":"Optionality: Expected Best of n Experiments","verification":"informal_only","review":"needs_review"}]},{"topic":"convolutional-neural-networks","url":"https://theorempath.com/topics/convolutional-neural-networks","title":"Convolutional Neural Networks","reviewedOn":"2026-04-13","claims":[{"localId":"convolution-equivariance","kind":"proposition","title":"Translation Equivariance of Convolution","verification":"informal_only","review":"needs_review"}]},{"topic":"coordinate-descent","url":"https://theorempath.com/topics/coordinate-descent","title":"Coordinate Descent","reviewedOn":"2026-04-27","claims":[{"localId":"cyclic-cd-convergence","kind":"theorem","title":"Convergence of Cyclic Coordinate Descent","verification":"informal_only","review":"needs_review"}]},{"topic":"copulas","url":"https://theorempath.com/topics/copulas","title":"Copulas","reviewedOn":"2026-04-13","claims":[{"localId":"frechet-hoeffding-bounds","kind":"theorem","title":"Frechet-Hoeffding Bounds","verification":"informal_only","review":"needs_review"},{"localId":"sklars-theorem","kind":"theorem","title":"Sklar's Theorem","verification":"informal_only","review":"draft"}]},{"topic":"counting-and-combinatorics","url":"https://theorempath.com/topics/counting-and-combinatorics","title":"Counting and Combinatorics","reviewedOn":"2026-04-26","claims":[{"localId":"binomial-theorem","kind":"theorem","title":"Binomial Theorem","verification":"informal_only","review":"needs_review"},{"localId":"stirling-approximation","kind":"theorem","title":"Stirling Approximation","verification":"informal_only","review":"needs_review"}]},{"topic":"coupling-arguments-and-mixing-time","url":"https://theorempath.com/topics/coupling-arguments-and-mixing-time","title":"Coupling Arguments and Mixing Time","reviewedOn":"2026-04-26","claims":[{"localId":"coupling-inequality","kind":"theorem","title":"Coupling Inequality","verification":"informal_only","review":"needs_review"},{"localId":"spectral-gap-mixing","kind":"theorem","title":"Spectral Gap and Mixing Time","verification":"informal_only","review":"needs_review"}]},{"topic":"cramer-rao-bound","url":"https://theorempath.com/topics/cramer-rao-bound","title":"Cramér-Rao Bound: Information Inequality, Achievability, and Sharper Variants","reviewedOn":"2026-04-19","claims":[{"localId":"bhattacharyya-bound","kind":"theorem","title":"Bhattacharyya Higher-Order Bound","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"biased-cramer-rao","kind":"theorem","title":"Cramér-Rao Bound for Biased Estimators","verification":"source_checked","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"cramer-rao-lower-bound","kind":"theorem","title":"Cramér-Rao Lower Bound (Scalar)","verification":"source_checked","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"hammersley-chapman-robbins","kind":"theorem","title":"Hammersley-Chapman-Robbins Bound (no regularity)","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"multivariate-cramer-rao","kind":"theorem","title":"Multivariate Cramér-Rao Bound","verification":"source_checked","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"van-trees-inequality","kind":"theorem","title":"van Trees (Bayesian Cramér-Rao) Inequality","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"cramer-wold-theorem","url":"https://theorempath.com/topics/cramer-wold-theorem","title":"Cramér-Wold Theorem","reviewedOn":"2026-04-26","claims":[{"localId":"cramer-wold-device","kind":"theorem","title":"Cramér-Wold Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"cross-entropy-loss-deep-dive","url":"https://theorempath.com/topics/cross-entropy-loss-deep-dive","title":"Cross-Entropy Loss: MLE, KL Divergence, and Classification","reviewedOn":"2026-07-03","claims":[{"localId":"cross-entropy-mle-equivalence","kind":"theorem","title":"Cross-Entropy as Maximum Likelihood","verification":"source_checked","review":"source_checked","sourceRoles":["background"]},{"localId":"mse-nonconvexity-in-logits","kind":"proposition","title":"MSE is Non-Convex in Logit Space","verification":"informal_only","review":"needs_review"}]},{"topic":"cross-validation-theory","url":"https://theorempath.com/topics/cross-validation-theory","title":"Cross-Validation Theory","reviewedOn":"2026-04-26","claims":[{"localId":"cv-stability-connection","kind":"theorem","title":"CV Error and Algorithmic Stability","verification":"informal_only","review":"needs_review"},{"localId":"loo-cv-unbiasedness","kind":"theorem","title":"LOO-CV is Nearly Unbiased","verification":"informal_only","review":"needs_review"}]},{"topic":"cubist-and-model-trees","url":"https://theorempath.com/topics/cubist-and-model-trees","title":"Cubist and Model Trees","reviewedOn":"2026-04-14","claims":[{"localId":"cubist-smoothing","kind":"proposition","title":"Cubist Smoothing Procedure","verification":"informal_only","review":"draft"},{"localId":"m5-splitting-criterion","kind":"proposition","title":"M5 Splitting Criterion","verification":"informal_only","review":"needs_review"}]},{"topic":"curriculum-learning","url":"https://theorempath.com/topics/curriculum-learning","title":"Curriculum Learning","reviewedOn":"2026-04-18","claims":[{"localId":"self-paced-formulation","kind":"proposition","title":"Self-Paced Learning as Joint Optimization","verification":"informal_only","review":"needs_review"}]},{"topic":"data-augmentation-theory","url":"https://theorempath.com/topics/data-augmentation-theory","title":"Data Augmentation Theory","reviewedOn":"2026-04-18","claims":[{"localId":"augmentation-as-regularization","kind":"proposition","title":"Augmentation as Implicit Regularization","verification":"informal_only","review":"draft"},{"localId":"vrm-principle","kind":"proposition","title":"Vicinal Risk Minimization","verification":"informal_only","review":"needs_review"}]},{"topic":"data-contamination-and-evaluation","url":"https://theorempath.com/topics/data-contamination-and-evaluation","title":"Data Contamination and Evaluation","reviewedOn":"2026-05-25","claims":[{"localId":"contamination-inflates-scores","kind":"proposition","title":"Contamination Inflation Bound","verification":"informal_only","review":"draft"}]},{"topic":"data-preprocessing-and-feature-engineering","url":"https://theorempath.com/topics/data-preprocessing-and-feature-engineering","title":"Data Preprocessing and Feature Engineering","reviewedOn":"2026-04-18","claims":[{"localId":"standardization-gradient-conditioning","kind":"proposition","title":"Standardization Improves Gradient Descent Conditioning","verification":"informal_only","review":"needs_review"}]},{"topic":"ddpg","url":"https://theorempath.com/topics/ddpg","title":"DDPG: Deep Deterministic Policy Gradient","reviewedOn":"2026-04-17","claims":[{"localId":"deterministic-policy-gradient","kind":"theorem","title":"Deterministic Policy Gradient","verification":"informal_only","review":"needs_review"}]},{"topic":"de-moivre-laplace-theorem","url":"https://theorempath.com/topics/de-moivre-laplace-theorem","title":"De Moivre-Laplace Theorem","reviewedOn":"2026-05-12","claims":[{"localId":"de-moivre-laplace-theorem","kind":"theorem","title":"De Moivre-Laplace Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"decision-theory-foundations","url":"https://theorempath.com/topics/decision-theory-foundations","title":"Decision Theory Foundations","reviewedOn":"2026-04-26","claims":[{"localId":"complete-class-sketch","kind":"theorem","title":"Wald Complete Class Theorem (Sketch)","verification":"informal_only","review":"needs_review"},{"localId":"savage-representation","kind":"theorem","title":"Savage Representation Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"decision-trees-and-ensembles","url":"https://theorempath.com/topics/decision-trees-and-ensembles","title":"Decision Trees and Ensembles","reviewedOn":"2026-04-22","claims":[{"localId":"bagging-variance-reduction","kind":"proposition","title":"Variance Reduction via Averaging","verification":"informal_only","review":"draft"}]},{"topic":"decoding-strategies","url":"https://theorempath.com/topics/decoding-strategies","title":"Decoding Strategies","reviewedOn":"2026-04-26","claims":[{"localId":"temperature-distribution-convergence","kind":"proposition","title":"Temperature Limits of the Softmax Distribution","verification":"informal_only","review":"needs_review"}]},{"topic":"deep-learning-goodfellow-book","url":"https://theorempath.com/topics/deep-learning-goodfellow-book","title":"Deep Learning (Goodfellow, Bengio, Courville)","reviewedOn":"2026-04-14","claims":[{"localId":"universal-approximation-reference","kind":"theorem","title":"Universal Approximation Theorem (Goodfellow Ch. 6)","verification":"informal_only","review":"needs_review"}]},{"topic":"deep-learning-time-series","url":"https://theorempath.com/topics/deep-learning-time-series","title":"Deep Learning for Time Series","reviewedOn":"2026-05-06","claims":[{"localId":"patchtst-quadratic-reduction","kind":"proposition","title":"PatchTST Patching Reduces Attention Cost","verification":"informal_only","review":"needs_review"},{"localId":"tcn-receptive-field","kind":"proposition","title":"TCN Receptive Field","verification":"informal_only","review":"draft"}]},{"topic":"deeponet","url":"https://theorempath.com/topics/deeponet","title":"DeepONet","reviewedOn":"2026-04-18","claims":[{"localId":"chen-chen-1995-universal-approximation","kind":"theorem","title":"Chen–Chen 1995 Universal Approximation for Nonlinear Operators","verification":"informal_only","review":"needs_review"}]},{"topic":"deepseek-models","url":"https://theorempath.com/topics/deepseek-models","title":"DeepSeek Models","reviewedOn":"2026-07-30","claims":[{"localId":"mla-kv-compression","kind":"proposition","title":"KV Cache Compression via Latent Projection","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"delta-method","url":"https://theorempath.com/topics/delta-method","title":"Delta Method","reviewedOn":"2026-05-12","claims":[{"localId":"delta-method-multivariate-statement","kind":"theorem","title":"Delta Method (multivariate)","verification":"informal_only","review":"needs_review"},{"localId":"delta-method-second-order","kind":"theorem","title":"Delta Method (second-order)","verification":"informal_only","review":"needs_review"},{"localId":"delta-method-univariate-statement","kind":"theorem","title":"Delta Method (univariate)","verification":"informal_only","review":"needs_review"}]},{"topic":"design-based-vs-model-based-inference","url":"https://theorempath.com/topics/design-based-vs-model-based-inference","title":"Design-Based vs. Model-Based Inference","reviewedOn":"2026-04-18","claims":[{"localId":"design-consistency-of-ht-estimator","kind":"theorem","title":"Design Consistency of the Horvitz-Thompson Estimator","verification":"informal_only","review":"needs_review"}]},{"topic":"detection-theory","url":"https://theorempath.com/topics/detection-theory","title":"Detection Theory","reviewedOn":"2026-04-13","claims":[{"localId":"neyman-pearson-lemma","kind":"lemma","title":"Neyman-Pearson Lemma","verification":"informal_only","review":"needs_review"},{"localId":"sprt-optimality","kind":"theorem","title":"Wald's Sequential Probability Ratio Test","verification":"informal_only","review":"needs_review"}]},{"topic":"differential-privacy","url":"https://theorempath.com/topics/differential-privacy","title":"Differential Privacy","reviewedOn":"2026-04-24","claims":[{"localId":"advanced-composition","kind":"theorem","title":"Advanced Composition Theorem","verification":"informal_only","review":"needs_review"},{"localId":"dp-definition-post-processing","kind":"proposition","title":"Post-Processing Immunity","verification":"informal_only","review":"needs_review"},{"localId":"laplace-mechanism-privacy","kind":"theorem","title":"Laplace Mechanism","verification":"informal_only","review":"needs_review"},{"localId":"privacy-amplification-by-subsampling","kind":"proposition","title":"Privacy Amplification by Subsampling","verification":"informal_only","review":"needs_review"}]},{"topic":"differentiation-in-rn","url":"https://theorempath.com/topics/differentiation-in-rn","title":"Differentiation in Rⁿ","reviewedOn":"2026-04-26","claims":[{"localId":"continuous-partials-imply-differentiability","kind":"theorem","title":"Continuous Partial Derivatives Imply Differentiability","verification":"informal_only","review":"needs_review"},{"localId":"gradient-steepest-ascent","kind":"theorem","title":"Gradient As Steepest Ascent Direction","verification":"informal_only","review":"needs_review"},{"localId":"multivariable-chain-rule","kind":"theorem","title":"Multivariable Chain Rule","verification":"informal_only","review":"needs_review"}]},{"topic":"diffusion-models","url":"https://theorempath.com/topics/diffusion-models","title":"Diffusion Models","reviewedOn":"2026-04-19","claims":[{"localId":"classifier-free-guidance","kind":"theorem","title":"Classifier-Free Guidance","verification":"informal_only","review":"needs_review"},{"localId":"ddpm-elbo","kind":"theorem","title":"DDPM Variational Lower Bound","verification":"informal_only","review":"needs_review"},{"localId":"denoising-score-matching","kind":"theorem","title":"Denoising Score Matching Equivalence","verification":"informal_only","review":"draft"},{"localId":"flow-matching-ot-objective","kind":"theorem","title":"Conditional Flow Matching","verification":"informal_only","review":"draft"},{"localId":"probability-flow-ode","kind":"theorem","title":"Probability Flow ODE","verification":"informal_only","review":"needs_review"},{"localId":"reverse-time-sde","kind":"theorem","title":"Anderson Reverse-Time SDE","verification":"informal_only","review":"needs_review"}]},{"topic":"dimensionality-reduction-theory","url":"https://theorempath.com/topics/dimensionality-reduction-theory","title":"Dimensionality Reduction Theory","reviewedOn":"2026-04-14","claims":[{"localId":"johnson-lindenstrauss-lemma","kind":"lemma","title":"Johnson-Lindenstrauss Lemma","verification":"informal_only","review":"needs_review"},{"localId":"tsne-cost-function","kind":"proposition","title":"t-SNE Cost Function","verification":"informal_only","review":"draft"}]},{"topic":"discrete-continuous-distribution-pairs","url":"https://theorempath.com/topics/discrete-continuous-distribution-pairs","title":"Discrete and Continuous Distribution Pairs","reviewedOn":"2026-05-12","claims":[{"localId":"binomial-poisson-rare-event-limit","kind":"theorem","title":"Poisson Limit of the Binomial","verification":"informal_only","review":"needs_review"},{"localId":"geometric-exponential-memorylessness-pair","kind":"theorem","title":"Geometric and Exponential Are the Unique Memoryless Distributions","verification":"informal_only","review":"needs_review"}]},{"topic":"distributed-consensus","url":"https://theorempath.com/topics/distributed-consensus","title":"Distributed Consensus","reviewedOn":"2026-04-15","claims":[{"localId":"byzantine-lower-bound","kind":"theorem","title":"Byzantine Fault Tolerance Lower Bound","verification":"informal_only","review":"needs_review"},{"localId":"flp-impossibility","kind":"theorem","title":"FLP Impossibility","verification":"informal_only","review":"needs_review"},{"localId":"paxos-safety","kind":"theorem","title":"Paxos Safety","verification":"informal_only","review":"needs_review"}]},{"topic":"distributed-training-theory","url":"https://theorempath.com/topics/distributed-training-theory","title":"Distributed Training Theory","reviewedOn":"2026-04-26","claims":[{"localId":"communication-computation-tradeoff","kind":"proposition","title":"Communication-Computation Tradeoff","verification":"informal_only","review":"needs_review"},{"localId":"linear-speedup-data-parallelism","kind":"theorem","title":"Ideal Linear Speedup of Synchronous Data-Parallel SGD","verification":"informal_only","review":"needs_review"}]},{"topic":"distributional-semantics","url":"https://theorempath.com/topics/distributional-semantics","title":"Distributional Semantics","reviewedOn":"2026-04-15","claims":[{"localId":"pmi-embedding-equivalence","kind":"theorem","title":"Skip-Gram with Negative Sampling Implicitly Factorizes a Shifted PMI Matrix","verification":"informal_only","review":"needs_review"}]},{"topic":"distributions-atlas","url":"https://theorempath.com/topics/distributions-atlas","title":"Distributions Atlas","reviewedOn":"2026-05-11","claims":[{"localId":"ratio-of-normal-and-chi-root-is-t","kind":"theorem","title":"Ratio of Normal and Root Chi-squared is Student-t","verification":"informal_only","review":"needs_review"},{"localId":"sum-of-iid-exponentials-is-gamma","kind":"theorem","title":"Sum of i.i.d. Exponentials is Gamma","verification":"informal_only","review":"needs_review"}]},{"topic":"document-intelligence","url":"https://theorempath.com/topics/document-intelligence","title":"Document Intelligence","reviewedOn":"2026-05-31","claims":[{"localId":"layout-aware-pretraining-objective","kind":"proposition","title":"Layout-Aware Masked Language Modeling","verification":"informal_only","review":"draft"}]},{"topic":"donut-and-ocr-free-document-understanding","url":"https://theorempath.com/topics/donut-and-ocr-free-document-understanding","title":"Donut and OCR-Free Document Understanding","reviewedOn":"2026-04-26","claims":[{"localId":"ocr-free-cross-entropy-objective","kind":"proposition","title":"OCR-Free Training Objective","verification":"informal_only","review":"needs_review"}]},{"topic":"double-debiased-machine-learning","url":"https://theorempath.com/topics/double-debiased-machine-learning","title":"Double/Debiased Machine Learning","reviewedOn":"2026-04-24","claims":[{"localId":"dml-asymptotic-normality","kind":"theorem","title":"DML Asymptotic Normality","verification":"informal_only","review":"needs_review"}]},{"topic":"double-descent","url":"https://theorempath.com/topics/double-descent","title":"Double Descent","reviewedOn":"2026-07-03","claims":[{"localId":"double-descent-peak","kind":"theorem","title":"Divergence at the Interpolation Threshold","verification":"informal_only","review":"needs_review"},{"localId":"min-norm-interpolation","kind":"theorem","title":"Min-Norm Interpolation in Overparameterized Regression","verification":"informal_only","review":"needs_review"}]},{"topic":"dpo-vs-grpo-vs-rl-reasoning","url":"https://theorempath.com/topics/dpo-vs-grpo-vs-rl-reasoning","title":"DPO vs GRPO vs RL for Reasoning","reviewedOn":"2026-05-27","claims":[{"localId":"dpo-implicit-reward","kind":"theorem","title":"DPO Implicit Reward Equivalence","verification":"informal_only","review":"needs_review"},{"localId":"grpo-objective","kind":"proposition","title":"GRPO Objective","verification":"informal_only","review":"needs_review"},{"localId":"rl-reasoning-objective","kind":"proposition","title":"RL with Verifier Feedback","verification":"informal_only","review":"draft"}]},{"topic":"dropout","url":"https://theorempath.com/topics/dropout","title":"Dropout","reviewedOn":"2026-04-26","claims":[{"localId":"dropout-ensemble-interpretation","kind":"theorem","title":"Dropout as Ensemble Averaging","verification":"informal_only","review":"needs_review"},{"localId":"dropout-linear-l2-equivalence","kind":"theorem","title":"Dropout in Linear Models is L2 Regularization","verification":"informal_only","review":"needs_review"}]},{"topic":"dynamic-programming","url":"https://theorempath.com/topics/dynamic-programming","title":"Dynamic Programming","reviewedOn":"2026-04-26","claims":[{"localId":"principle-of-optimality","kind":"theorem","title":"Bellman's Principle of Optimality","verification":"informal_only","review":"needs_review"}]},{"topic":"e-processes","url":"https://theorempath.com/topics/e-processes","title":"e-processes","reviewedOn":"2026-05-13","claims":[{"localId":"conditional-e-value-supermartingale","kind":"theorem","title":"Running Product of Conditional e-values Is a Supermartingale","verification":"informal_only","review":"needs_review"},{"localId":"villes-inequality-e-processes","kind":"theorem","title":"Ville's Inequality","verification":"informal_only","review":"needs_review"}]},{"topic":"e-values","url":"https://theorempath.com/topics/e-values","title":"e-values","reviewedOn":"2026-05-13","claims":[{"localId":"markov-e-value-bound","kind":"theorem","title":"Markov Bound for e-values","verification":"informal_only","review":"needs_review"}]},{"topic":"e-values-and-anytime-valid-inference","url":"https://theorempath.com/topics/e-values-and-anytime-valid-inference","title":"E-Values and Anytime-Valid Inference","reviewedOn":"2026-04-26","claims":[{"localId":"e-value-bh-fdr","kind":"theorem","title":"e-BH Controls FDR Under Arbitrary Dependence","verification":"informal_only","review":"draft"},{"localId":"villes-inequality","kind":"theorem","title":"Ville's Inequality","verification":"informal_only","review":"needs_review"}]},{"topic":"edge-and-on-device-ml","url":"https://theorempath.com/topics/edge-and-on-device-ml","title":"Edge and On-Device ML","reviewedOn":"2026-04-13","claims":[{"localId":"uniform-quantization-error-bound","kind":"proposition","title":"Uniform Quantization Mean-Squared Error","verification":"informal_only","review":"draft"}]},{"topic":"efficient-transformers-survey","url":"https://theorempath.com/topics/efficient-transformers-survey","title":"Efficient Transformers Survey","reviewedOn":"2026-05-27","claims":[{"localId":"linear-attention-kernel-trick","kind":"proposition","title":"Linear Attention via Kernel Decomposition","verification":"informal_only","review":"needs_review"},{"localId":"performer-approximation-bound","kind":"proposition","title":"Performer Approximation Quality","verification":"informal_only","review":"needs_review"}]},{"topic":"eigenvalues-and-eigenvectors","url":"https://theorempath.com/topics/eigenvalues-and-eigenvectors","title":"Eigenvalues and Eigenvectors","reviewedOn":"2026-04-13","claims":[{"localId":"spectral-theorem-symmetric","kind":"theorem","title":"Spectral Theorem for Symmetric Matrices","verification":"informal_only","review":"needs_review"}]},{"topic":"elastic-net","url":"https://theorempath.com/topics/elastic-net","title":"Elastic Net","reviewedOn":"2026-04-13","claims":[{"localId":"elastic-net-grouping","kind":"theorem","title":"Elastic Net Grouping Effect","verification":"informal_only","review":"needs_review"}]},{"topic":"elements-of-statistical-learning-book","url":"https://theorempath.com/topics/elements-of-statistical-learning-book","title":"The Elements of Statistical Learning (Hastie, Tibshirani, Friedman)","reviewedOn":"2026-04-14","claims":[{"localId":"esl-bias-variance","kind":"theorem","title":"Bias-Variance Decomposition (ESL Chapter 2)","verification":"informal_only","review":"needs_review"}]},{"topic":"em-algorithm","url":"https://theorempath.com/topics/em-algorithm","title":"The EM Algorithm","reviewedOn":"2026-05-04","claims":[{"localId":"em-elbo-decomposition","kind":"theorem","title":"ELBO Decomposition","verification":"informal_only","review":"needs_review"},{"localId":"em-monotonic-convergence","kind":"theorem","title":"EM Monotonically Increases the Likelihood","verification":"informal_only","review":"needs_review"}]},{"topic":"empirical-bayes-vs-hierarchical-bayes","url":"https://theorempath.com/topics/empirical-bayes-vs-hierarchical-bayes","title":"Empirical Bayes vs Hierarchical Bayes","reviewedOn":"2026-04-26","claims":[{"localId":"hyperparameter-uncertainty-decomposition","kind":"theorem","title":"Posterior Mean and Variance Under Hyperparameter Integration","verification":"informal_only","review":"needs_review"}]},{"topic":"empirical-processes-and-chaining","url":"https://theorempath.com/topics/empirical-processes-and-chaining","title":"Empirical Processes and Chaining","reviewedOn":"2026-05-05","claims":[{"localId":"dudley-entropy-integral","kind":"theorem","title":"Dudley's Entropy Integral","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"generic-chaining-bound","kind":"theorem","title":"Talagrand's Generic Chaining (Majorizing Measures)","verification":"source_checked","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"ledoux-talagrand-contraction","kind":"theorem","title":"Ledoux-Talagrand Contraction Inequality","verification":"informal_only","review":"draft"},{"localId":"slepian-sudakov-fernique","kind":"theorem","title":"Sudakov-Fernique Inequality","verification":"informal_only","review":"needs_review"},{"localId":"sudakov-minoration-bound","kind":"theorem","title":"Sudakov's Minoration","verification":"informal_only","review":"needs_review"}]},{"topic":"empirical-risk-minimization","url":"https://theorempath.com/topics/empirical-risk-minimization","title":"Empirical Risk Minimization","reviewedOn":"2026-04-26","claims":[{"localId":"erm-generalization-bound","kind":"theorem","title":"ERM Generalization via Uniform Convergence","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"finite-class-hoeffding-approx-erm-excess-risk-tail","kind":"theorem","title":"Finite-class Hoeffding approximate-ERM excess-risk tail (Lean-verified)","verification":"lean_verified","review":"needs_review"},{"localId":"finite-class-hoeffding-erm-excess-risk-tail","kind":"theorem","title":"Finite-class Hoeffding ERM excess-risk tail (Lean-verified)","verification":"lean_verified","review":"needs_review"},{"localId":"vc-style-erm-excess-risk-tail","kind":"theorem","title":"Effective-Growth VC-Style ERM Excess-Risk Tail","verification":"lean_verified","review":"needs_review"}]},{"topic":"energy-based-models","url":"https://theorempath.com/topics/energy-based-models","title":"Energy-Based Models","reviewedOn":"2026-07-26","claims":[{"localId":"boltzmann-distribution-ebm","kind":"theorem","title":"MLE Gradient for Energy-Based Models","verification":"informal_only","review":"draft"},{"localId":"score-matching-equivalence","kind":"theorem","title":"Score Matching Avoids the Partition Function","verification":"informal_only","review":"draft"}]},{"topic":"energy-distance-and-distance-covariance","url":"https://theorempath.com/topics/energy-distance-and-distance-covariance","title":"Energy Distance and Distance Covariance","reviewedOn":"2026-07-26","claims":[{"localId":"distance-covariance-independence","kind":"theorem","title":"Distance Covariance Characterizes Independence","verification":"informal_only","review":"needs_review"},{"localId":"energy-distance-characterization","kind":"theorem","title":"Energy Distance Characterizes Equality of Distributions","verification":"informal_only","review":"needs_review"},{"localId":"energy-distance-mmd-equivalence","kind":"theorem","title":"Energy Distance Equals Twice Squared MMD","verification":"informal_only","review":"needs_review"}]},{"topic":"energy-efficiency-and-green-ai","url":"https://theorempath.com/topics/energy-efficiency-and-green-ai","title":"Energy Efficiency and Green AI","reviewedOn":"2026-04-18","claims":[{"localId":"chinchilla-optimal-allocation","kind":"proposition","title":"Chinchilla Optimal Compute Allocation","verification":"informal_only","review":"needs_review"},{"localId":"efficiency-reporting-principle","kind":"proposition","title":"Efficiency Reporting Principle","verification":"informal_only","review":"needs_review"}]},{"topic":"energy-in-statistics-and-machine-learning","url":"https://theorempath.com/topics/energy-in-statistics-and-machine-learning","title":"Energy in Statistics and Machine Learning","reviewedOn":"2026-07-26","claims":[{"localId":"positive-density-energy-representation","kind":"proposition","title":"Positive Densities Admit an Energy Representation","verification":"informal_only","review":"needs_review"}]},{"topic":"ensemble-methods-theory","url":"https://theorempath.com/topics/ensemble-methods-theory","title":"Ensemble Methods Theory","reviewedOn":"2026-04-14","claims":[{"localId":"boosting-bias-reduction","kind":"proposition","title":"Boosting Reduces Bias","verification":"informal_only","review":"draft"},{"localId":"ensemble-variance-reduction","kind":"theorem","title":"Variance Reduction by Averaging","verification":"informal_only","review":"needs_review"}]},{"topic":"epsilon-nets-and-covering-numbers","url":"https://theorempath.com/topics/epsilon-nets-and-covering-numbers","title":"Epsilon-Nets and Covering Numbers","reviewedOn":"2026-04-26","claims":[{"localId":"covering-packing-relationship","kind":"theorem","title":"Covering-Packing Duality","verification":"informal_only","review":"needs_review"},{"localId":"dudley-integral-bound","kind":"theorem","title":"Dudley Entropy Integral Bound","verification":"informal_only","review":"needs_review"}]},{"topic":"equilibrium-and-implicit-models","url":"https://theorempath.com/topics/equilibrium-and-implicit-models","title":"Equilibrium and Implicit-Layer Models","reviewedOn":"2026-04-26","claims":[{"localId":"deq-fixed-point","kind":"proposition","title":"Deep Equilibrium Model","verification":"informal_only","review":"needs_review"},{"localId":"implicit-differentiation-theorem","kind":"theorem","title":"Implicit Differentiation for Fixed Points","verification":"informal_only","review":"needs_review"}]},{"topic":"equivariant-deep-learning","url":"https://theorempath.com/topics/equivariant-deep-learning","title":"Equivariant Deep Learning","reviewedOn":"2026-04-26","claims":[{"localId":"equivariance-definition","kind":"proposition","title":"Equivariance","verification":"informal_only","review":"needs_review"},{"localId":"equivariance-parameter-sharing","kind":"theorem","title":"Equivariance Implies Weight Sharing","verification":"informal_only","review":"needs_review"}]},{"topic":"era-of-experience","url":"https://theorempath.com/topics/era-of-experience","title":"The Era of Experience","reviewedOn":"2026-08-08","claims":[{"localId":"absorbing-error-imitation-loss","kind":"proposition","title":"An Absorbing-Error MDP Gives Quadratic Imitation Loss","verification":"informal_only","review":"needs_review"}]},{"topic":"ethics-and-fairness-in-ml","url":"https://theorempath.com/topics/ethics-and-fairness-in-ml","title":"Ethics and Fairness in ML","reviewedOn":"2026-04-26","claims":[{"localId":"equalized-odds-tradeoff","kind":"proposition","title":"Equalized Odds via Post-Processing","verification":"informal_only","review":"needs_review"},{"localId":"fairness-impossibility-theorem","kind":"theorem","title":"Impossibility of Simultaneous Fairness","verification":"informal_only","review":"needs_review"}]},{"topic":"evaluation-metrics-and-properties","url":"https://theorempath.com/topics/evaluation-metrics-and-properties","title":"Evaluation Metrics and Properties","reviewedOn":"2026-04-26","claims":[{"localId":"proper-scoring-rule-characterization","kind":"theorem","title":"Proper Scoring Rules Encourage Honest Probabilities","verification":"informal_only","review":"needs_review"}]},{"topic":"expectation-maximization-variants","url":"https://theorempath.com/topics/expectation-maximization-variants","title":"EM Algorithm Variants","reviewedOn":"2026-04-14","claims":[{"localId":"mcem-convergence","kind":"theorem","title":"MCEM Convergence","verification":"informal_only","review":"needs_review"},{"localId":"variational-em-elbo","kind":"theorem","title":"Variational EM Monotonically Increases the ELBO","verification":"informal_only","review":"needs_review"}]},{"topic":"expectation-variance-covariance-moments","url":"https://theorempath.com/topics/expectation-variance-covariance-moments","title":"Expectation, Variance, Covariance, and Moments","reviewedOn":"2026-07-03","claims":[{"localId":"chebyshev-inequality","kind":"theorem","title":"Chebyshev's Inequality","verification":"source_checked","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"law-of-total-variance","kind":"theorem","title":"Law of Total Variance (Eve's Law)","verification":"lean_verified","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"linearity-of-expectation","kind":"theorem","title":"Linearity of Expectation","verification":"lean_verified","review":"source_checked","sourceRoles":["proof"]},{"localId":"variance-of-sum","kind":"theorem","title":"Variance of a Sum","verification":"lean_verified","review":"source_checked","sourceRoles":["background","proof"]}]},{"topic":"expected-utility","url":"https://theorempath.com/topics/expected-utility","title":"Expected Utility Theory","reviewedOn":"2026-04-26","claims":[{"localId":"risk-aversion-concavity","kind":"theorem","title":"Risk Aversion Equivalence","verification":"informal_only","review":"needs_review"},{"localId":"vnm-utility-theorem","kind":"theorem","title":"Von Neumann-Morgenstern Expected Utility Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"exploration-vs-exploitation","url":"https://theorempath.com/topics/exploration-vs-exploitation","title":"Exploration vs Exploitation","reviewedOn":"2026-04-17","claims":[{"localId":"ucb-regret-bound","kind":"theorem","title":"UCB1 Regret Bound","verification":"informal_only","review":"needs_review"}]},{"topic":"exploratory-data-analysis","url":"https://theorempath.com/topics/exploratory-data-analysis","title":"Exploratory Data Analysis","reviewedOn":"2026-04-14","claims":[{"localId":"correlation-not-causation-bound","kind":"proposition","title":"Spurious Correlation in High Dimensions","verification":"informal_only","review":"draft"}]},{"topic":"exponential-distribution","url":"https://theorempath.com/topics/exponential-distribution","title":"Exponential Distribution","reviewedOn":"2026-05-11","claims":[{"localId":"exponential-memoryless","kind":"theorem","title":"Memoryless Property","verification":"informal_only","review":"needs_review"},{"localId":"exponential-mgf","kind":"theorem","title":"Exponential MGF","verification":"informal_only","review":"needs_review"},{"localId":"exponential-mle","kind":"theorem","title":"MLE for the Rate","verification":"informal_only","review":"needs_review"},{"localId":"memoryless-characterizes-exponential","kind":"theorem","title":"Memoryless Characterization","verification":"informal_only","review":"draft"},{"localId":"minimum-of-exponentials","kind":"theorem","title":"Minimum of Independent Exponentials","verification":"informal_only","review":"needs_review"}]},{"topic":"exponential-function-properties","url":"https://theorempath.com/topics/exponential-function-properties","title":"Exponential Function Properties","reviewedOn":"2026-04-18","claims":[{"localId":"exp-series-convergence","kind":"theorem","title":"Convergence of the Exponential Series","verification":"informal_only","review":"needs_review"},{"localId":"exp-unique-fixed-point","kind":"proposition","title":"Uniqueness of the Exponential","verification":"informal_only","review":"needs_review"}]},{"topic":"extreme-value-theory","url":"https://theorempath.com/topics/extreme-value-theory","title":"Extreme Value Theory","reviewedOn":"2026-04-15","claims":[{"localId":"fisher-tippett-gnedenko","kind":"theorem","title":"Fisher-Tippett-Gnedenko Theorem","verification":"informal_only","review":"needs_review"},{"localId":"pickands-balkema-de-haan","kind":"theorem","title":"Pickands-Balkema-de Haan Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"f-distribution-and-anova","url":"https://theorempath.com/topics/f-distribution-and-anova","title":"F-Distribution and ANOVA","reviewedOn":"2026-05-11","claims":[{"localId":"anova-decomposition","kind":"theorem","title":"One-Way ANOVA Variance Decomposition","verification":"informal_only","review":"needs_review"},{"localId":"f-distribution-construction","kind":"theorem","title":"F as a Ratio of Independent Chi-Squareds","verification":"informal_only","review":"needs_review"},{"localId":"one-way-anova-f-test","kind":"theorem","title":"One-Way ANOVA F-Test","verification":"informal_only","review":"needs_review"},{"localId":"variance-ratio-f-test","kind":"theorem","title":"F-Test for Equal Variances","verification":"informal_only","review":"needs_review"}]},{"topic":"fanos-inequality","url":"https://theorempath.com/topics/fanos-inequality","title":"Fano Inequality","reviewedOn":"2026-04-26","claims":[{"localId":"fano-inequality","kind":"theorem","title":"Fano Inequality","verification":"informal_only","review":"draft"},{"localId":"fano-method-minimax","kind":"proposition","title":"The Fano Method for Minimax Rates","verification":"informal_only","review":"needs_review"}]},{"topic":"fast-fourier-transform","url":"https://theorempath.com/topics/fast-fourier-transform","title":"Fast Fourier Transform","reviewedOn":"2026-04-14","claims":[{"localId":"convolution-theorem","kind":"theorem","title":"Convolution Theorem","verification":"informal_only","review":"needs_review"},{"localId":"fft-complexity","kind":"theorem","title":"FFT Complexity","verification":"informal_only","review":"needs_review"}]},{"topic":"fat-tails","url":"https://theorempath.com/topics/fat-tails","title":"Fat Tails and Heavy-Tailed Distributions","reviewedOn":"2026-04-17","claims":[{"localId":"generalized-clt-stable-laws","kind":"theorem","title":"Generalized Central Limit Theorem (Stable Laws)","verification":"informal_only","review":"needs_review"},{"localId":"lln-slow-convergence-fat-tails","kind":"theorem","title":"Slow LLN Convergence Under Fat Tails","verification":"informal_only","review":"needs_review"}]},{"topic":"feature-importance-and-interpretability","url":"https://theorempath.com/topics/feature-importance-and-interpretability","title":"Feature Importance and Interpretability","reviewedOn":"2026-04-26","claims":[{"localId":"lime-local-fidelity","kind":"proposition","title":"LIME Local Fidelity","verification":"informal_only","review":"needs_review"},{"localId":"shapley-value-uniqueness","kind":"theorem","title":"Shapley Value Uniqueness","verification":"informal_only","review":"needs_review"}]},{"topic":"federated-learning","url":"https://theorempath.com/topics/federated-learning","title":"Federated Learning","reviewedOn":"2026-04-26","claims":[{"localId":"fedavg-homogeneous-equivalence","kind":"proposition","title":"FedAvg Equals Ordinary Gradient Descent in the Homogeneous Regime","verification":"informal_only","review":"needs_review"},{"localId":"heterogeneity-amplifies-client-drift","kind":"proposition","title":"Heterogeneity Amplifies with Local Steps","verification":"informal_only","review":"needs_review"}]},{"topic":"feedforward-networks-and-backpropagation","url":"https://theorempath.com/topics/feedforward-networks-and-backpropagation","title":"Feedforward Networks and Backpropagation","reviewedOn":"2026-06-25","claims":[{"localId":"backprop-complexity","kind":"proposition","title":"Backpropagation Complexity","verification":"informal_only","review":"needs_review"},{"localId":"universal-approximation-theorem","kind":"theorem","title":"Universal Approximation Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"feynman-kac-formula","url":"https://theorempath.com/topics/feynman-kac-formula","title":"Feynman–Kac Formula","reviewedOn":"2026-04-26","claims":[{"localId":"feynman-kac-representation","kind":"theorem","title":"Feynman–Kac Representation","verification":"informal_only","review":"needs_review"}]},{"topic":"fine-tuning-and-adaptation","url":"https://theorempath.com/topics/fine-tuning-and-adaptation","title":"Fine-Tuning and Adaptation","reviewedOn":"2026-04-26","claims":[{"localId":"lora-rank-bound","kind":"proposition","title":"LoRA Expressiveness Bound","verification":"informal_only","review":"needs_review"}]},{"topic":"fisher-information","url":"https://theorempath.com/topics/fisher-information","title":"Fisher Information: Curvature, KL Geometry, and the Natural Gradient","reviewedOn":"2026-04-19","claims":[{"localId":"bartlett-identities","kind":"theorem","title":"Bartlett Identities (First and Second)","verification":"source_checked","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"fisher-additivity","kind":"proposition","title":"Additivity for Independent Samples","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"fisher-information-hessian-identity","kind":"corollary","title":"Hessian Form (corollary of Bartlett II)","verification":"source_checked","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"fisher-kl-hessian-identity","kind":"theorem","title":"Fisher Information is the KL Hessian","verification":"source_checked","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"natural-gradient-invariance","kind":"theorem","title":"Parameterization Invariance of the Natural Gradient","verification":"source_checked","review":"source_checked","sourceRoles":["background","proof"]}]},{"topic":"flash-attention","url":"https://theorempath.com/topics/flash-attention","title":"Flash Attention","reviewedOn":"2026-04-18","claims":[{"localId":"flash-attention-io-complexity","kind":"theorem","title":"Flash Attention IO Complexity","verification":"informal_only","review":"needs_review"},{"localId":"online-softmax-correctness","kind":"proposition","title":"Online Softmax Equivalence","verification":"informal_only","review":"needs_review"}]},{"topic":"floating-point-arithmetic","url":"https://theorempath.com/topics/floating-point-arithmetic","title":"Floating-Point Arithmetic","reviewedOn":"2026-04-13","claims":[{"localId":"floating-point-relative-error","kind":"proposition","title":"Fundamental Axiom of Floating-Point Arithmetic","verification":"informal_only","review":"needs_review"}]},{"topic":"florence-and-vision-foundation-models","url":"https://theorempath.com/topics/florence-and-vision-foundation-models","title":"Florence and Vision Foundation Models","reviewedOn":"2026-05-31","claims":[{"localId":"unified-vision-task-formulation","kind":"proposition","title":"Unified Task Formulation via Sequence Generation","verification":"informal_only","review":"needs_review"}]},{"topic":"flow-matching","url":"https://theorempath.com/topics/flow-matching","title":"Flow Matching","reviewedOn":"2026-05-27","claims":[{"localId":"conditional-flow-matching-theorem","kind":"proposition","title":"Straight-Line Conditional Paths","verification":"informal_only","review":"needs_review"},{"localId":"flow-matching-objective-equivalence","kind":"theorem","title":"FM and CFM Objectives Have the Same Gradients","verification":"informal_only","review":"draft"}]},{"topic":"fokker-planck-equation","url":"https://theorempath.com/topics/fokker-planck-equation","title":"Fokker–Planck Equation","reviewedOn":"2026-04-18","claims":[{"localId":"fokker-planck-derivation-from-ito","kind":"theorem","title":"Fokker–Planck Derivation from Itô","verification":"informal_only","review":"needs_review"}]},{"topic":"foundational-dependencies","url":"https://theorempath.com/topics/foundational-dependencies","title":"Foundational Dependencies","reviewedOn":"2026-04-14","claims":[{"localId":"practical-foundations","kind":"proposition","title":"For ML practitioners, ZFC is invisible","verification":"informal_only","review":"needs_review"}]},{"topic":"fourier-neural-operator","url":"https://theorempath.com/topics/fourier-neural-operator","title":"Fourier Neural Operator","reviewedOn":"2026-04-18","claims":[{"localId":"fno-universal-approximation","kind":"theorem","title":"FNO Universal Approximation (Kovachki, Lanthaler, Mishra 2023)","verification":"informal_only","review":"needs_review"}]},{"topic":"fox-forget-gate","url":"https://theorempath.com/topics/fox-forget-gate","title":"Forgetting Transformer (FoX)","reviewedOn":"2026-05-29","claims":[{"localId":"forgetting-attention-definition","kind":"proposition","title":"Forgetting Attention is Attention With Log-Domain Decay","verification":"informal_only","review":"needs_review"},{"localId":"forgetting-attention-recency-bound","kind":"proposition","title":"Recency Bias of Forgetting Attention (Bounded-Logit Variant)","verification":"informal_only","review":"needs_review"}]},{"topic":"fsrs-spaced-repetition-scheduling","url":"https://theorempath.com/topics/fsrs-spaced-repetition-scheduling","title":"FSRS: Spaced-Repetition Scheduling as Parameter Estimation","reviewedOn":"2026-07-05","claims":[{"localId":"fsrs-power-law-forgetting-curve","kind":"proposition","title":"The FSRS Power-Law Forgetting Curve","verification":"informal_only","review":"needs_review"}]},{"topic":"functional-analysis-core","url":"https://theorempath.com/topics/functional-analysis-core","title":"Functional Analysis Core","reviewedOn":"2026-04-26","claims":[{"localId":"banach-alaoglu","kind":"theorem","title":"Banach-Alaoglu Theorem","verification":"informal_only","review":"needs_review"},{"localId":"closed-graph-theorem","kind":"theorem","title":"Closed Graph Theorem","verification":"informal_only","review":"draft"},{"localId":"hahn-banach","kind":"theorem","title":"Hahn-Banach Theorem","verification":"informal_only","review":"needs_review"},{"localId":"lax-milgram","kind":"theorem","title":"Lax-Milgram Theorem","verification":"informal_only","review":"needs_review"},{"localId":"open-mapping-theorem","kind":"theorem","title":"Open Mapping Theorem","verification":"informal_only","review":"needs_review"},{"localId":"riesz-representation-hilbert","kind":"theorem","title":"Riesz Representation Theorem (Hilbert Space)","verification":"informal_only","review":"needs_review"},{"localId":"uniform-boundedness-principle","kind":"theorem","title":"Uniform Boundedness Principle (Banach-Steinhaus)","verification":"informal_only","review":"needs_review"}]},{"topic":"fused-kernels","url":"https://theorempath.com/topics/fused-kernels","title":"Fused Kernels","reviewedOn":"2026-04-26","claims":[{"localId":"fusion-io-reduction","kind":"proposition","title":"IO Reduction from Kernel Fusion","verification":"informal_only","review":"needs_review"}]},{"topic":"game-theory","url":"https://theorempath.com/topics/game-theory","title":"Game Theory Foundations","reviewedOn":"2026-04-26","claims":[{"localId":"nash-existence","kind":"theorem","title":"Nash Existence Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"gamma-distribution","url":"https://theorempath.com/topics/gamma-distribution","title":"Gamma Distribution","reviewedOn":"2026-05-11","claims":[{"localId":"chi-squared-is-gamma","kind":"theorem","title":"Chi-squared as a Gamma","verification":"informal_only","review":"needs_review"},{"localId":"gamma-additivity","kind":"theorem","title":"Gamma Additivity","verification":"informal_only","review":"draft"},{"localId":"gamma-mgf","kind":"theorem","title":"Gamma MGF","verification":"informal_only","review":"needs_review"},{"localId":"gamma-posterior-for-poisson-rate","kind":"theorem","title":"Gamma-Poisson Conjugacy","verification":"informal_only","review":"draft"}]},{"topic":"gauss-markov-theorem","url":"https://theorempath.com/topics/gauss-markov-theorem","title":"Gauss-Markov Theorem","reviewedOn":"2026-04-27","claims":[{"localId":"gauss-markov","kind":"theorem","title":"Gauss-Markov Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"gaussian-mixture-models-and-em","url":"https://theorempath.com/topics/gaussian-mixture-models-and-em","title":"Gaussian Mixture Models and EM","reviewedOn":"2026-04-26","claims":[{"localId":"gmm-em-convergence","kind":"proposition","title":"EM for GMMs Monotonically Increases the Log-Likelihood","verification":"informal_only","review":"needs_review"},{"localId":"gmm-kmeans-limit","kind":"proposition","title":"K-Means as the Hard-Assignment Limit of GMMs","verification":"informal_only","review":"needs_review"}]},{"topic":"gaussian-processes-for-ml","url":"https://theorempath.com/topics/gaussian-processes-for-ml","title":"Gaussian Processes for Machine Learning","reviewedOn":"2026-04-26","claims":[{"localId":"gp-log-marginal-likelihood","kind":"proposition","title":"Log Marginal Likelihood Balances Fit and Complexity","verification":"source_checked","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"gp-mean-is-kernel-ridge","kind":"proposition","title":"GP Posterior Mean Equals Kernel Ridge Regression","verification":"source_checked","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"gp-posterior-theorem","kind":"theorem","title":"GP Posterior Predictive Distribution","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"gaussian-processes-regression","url":"https://theorempath.com/topics/gaussian-processes-regression","title":"Gaussian Process Regression","reviewedOn":"2026-05-08","claims":[{"localId":"gp-noise-free-rbf-interpolant","kind":"proposition","title":"Noise-Free GP Equals RBF Interpolation","verification":"informal_only","review":"needs_review"}]},{"topic":"gaussian-splatting","url":"https://theorempath.com/topics/gaussian-splatting","title":"3D Gaussian Splatting","reviewedOn":"2026-05-26","claims":[{"localId":"gaussian-projection-to-2d","kind":"proposition","title":"Projection of 3D Gaussian to 2D","verification":"informal_only","review":"needs_review"},{"localId":"splatting-rendering-equation","kind":"proposition","title":"Alpha-Compositing Rendering","verification":"informal_only","review":"draft"}]},{"topic":"gemini-and-google-models","url":"https://theorempath.com/topics/gemini-and-google-models","title":"Gemini and Google Models","reviewedOn":"2026-07-30","claims":[{"localId":"long-context-attention-cost","kind":"proposition","title":"Quadratic Attention Cost for Long Sequences","verification":"informal_only","review":"needs_review"}]},{"topic":"generalized-additive-models","url":"https://theorempath.com/topics/generalized-additive-models","title":"Generalized Additive Models","reviewedOn":"2026-04-26","claims":[{"localId":"backfitting-convergence","kind":"theorem","title":"Convergence of the Backfitting Algorithm","verification":"informal_only","review":"needs_review"}]},{"topic":"generative-adversarial-networks","url":"https://theorempath.com/topics/generative-adversarial-networks","title":"Generative Adversarial Networks","reviewedOn":"2026-04-14","claims":[{"localId":"gan-optimal-discriminator","kind":"theorem","title":"Optimal Discriminator","verification":"informal_only","review":"needs_review"},{"localId":"wgan-em-distance","kind":"proposition","title":"Wasserstein GAN Objective","verification":"informal_only","review":"draft"}]},{"topic":"gibbs-sampling","url":"https://theorempath.com/topics/gibbs-sampling","title":"Gibbs Sampling","reviewedOn":"2026-05-06","claims":[{"localId":"gibbs-as-mh","kind":"theorem","title":"Gibbs Sampling Has Acceptance Probability 1","verification":"informal_only","review":"needs_review"},{"localId":"gibbs-convergence","kind":"theorem","title":"Convergence of the Gibbs Sampler","verification":"informal_only","review":"needs_review"}]},{"topic":"git-and-gitlab-for-ml-research","url":"https://theorempath.com/topics/git-and-gitlab-for-ml-research","title":"Git and GitLab for ML Research","reviewedOn":"2026-04-18","claims":[{"localId":"large-binary-history-principle","kind":"proposition","title":"Large Binary History Principle","verification":"informal_only","review":"needs_review"}]},{"topic":"glivenko-cantelli-theorem","url":"https://theorempath.com/topics/glivenko-cantelli-theorem","title":"Glivenko-Cantelli Theorem","reviewedOn":"2026-05-04","claims":[{"localId":"dvoretzky-kiefer-wolfowitz","kind":"theorem","title":"Dvoretzky-Kiefer-Wolfowitz (DKW) Inequality","verification":"informal_only","review":"needs_review"},{"localId":"glivenko-cantelli","kind":"theorem","title":"Glivenko-Cantelli Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"global-workspace-interpretability","url":"https://theorempath.com/topics/global-workspace-interpretability","title":"Jacobian Lens and Global Workspace Interpretability","reviewedOn":"2026-07-13","claims":[{"localId":"mean-jacobian-first-order-response","kind":"proposition","title":"Mean-Jacobian First-Order Response","verification":"informal_only","review":"needs_review"}]},{"topic":"goodness-of-fit-tests","url":"https://theorempath.com/topics/goodness-of-fit-tests","title":"Goodness-of-Fit Tests","reviewedOn":"2026-04-26","claims":[{"localId":"glivenko-cantelli","kind":"theorem","title":"Glivenko-Cantelli Theorem","verification":"informal_only","review":"needs_review"},{"localId":"ks-test-statistic","kind":"theorem","title":"Kolmogorov-Smirnov Test","verification":"informal_only","review":"draft"},{"localId":"probability-integral-transform","kind":"theorem","title":"Probability Integral Transform","verification":"informal_only","review":"needs_review"}]},{"topic":"gpt-series-evolution","url":"https://theorempath.com/topics/gpt-series-evolution","title":"GPT Series Evolution","reviewedOn":"2026-07-30","claims":[{"localId":"in-context-learning-emergence","kind":"proposition","title":"In-Context Learning as Implicit Bayesian Inference","verification":"informal_only","review":"needs_review"}]},{"topic":"gpu-compute-model","url":"https://theorempath.com/topics/gpu-compute-model","title":"GPU Compute Model","reviewedOn":"2026-04-18","claims":[{"localId":"roofline-bound","kind":"proposition","title":"Roofline Performance Bound","verification":"informal_only","review":"needs_review"}]},{"topic":"gradient-boosting","url":"https://theorempath.com/topics/gradient-boosting","title":"Gradient Boosting","reviewedOn":"2026-04-26","claims":[{"localId":"adaboost-exponential-loss","kind":"proposition","title":"AdaBoost Minimizes Exponential Loss","verification":"informal_only","review":"needs_review"},{"localId":"boosting-functional-gradient-descent","kind":"theorem","title":"Gradient Boosting as Functional Gradient Descent","verification":"informal_only","review":"needs_review"}]},{"topic":"gradient-descent-variants","url":"https://theorempath.com/topics/gradient-descent-variants","title":"Gradient Descent Variants","reviewedOn":"2026-04-14","claims":[{"localId":"adam-update-rule","kind":"proposition","title":"Adam Optimizer","verification":"informal_only","review":"needs_review"},{"localId":"sgd-convergence-rate","kind":"theorem","title":"SGD Convergence for Smooth Convex Functions","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"gradient-flow-and-vanishing-gradients","url":"https://theorempath.com/topics/gradient-flow-and-vanishing-gradients","title":"Gradient Flow and Vanishing Gradients","reviewedOn":"2026-04-14","claims":[{"localId":"jacobian-chain-gradient-bound","kind":"theorem","title":"Jacobian Chain Gradient Bound","verification":"informal_only","review":"needs_review"},{"localId":"sigmoid-gradient-saturation","kind":"proposition","title":"Sigmoid Gradient Saturation","verification":"informal_only","review":"needs_review"}]},{"topic":"gram-matrices-and-kernel-matrices","url":"https://theorempath.com/topics/gram-matrices-and-kernel-matrices","title":"Gram Matrices and Kernel Matrices","reviewedOn":"2026-04-26","claims":[{"localId":"gram-matrix-psd","kind":"theorem","title":"Gram Matrices are Positive Semidefinite","verification":"informal_only","review":"needs_review"},{"localId":"kernel-matrix-eigenvalue-geometry","kind":"proposition","title":"Gram Matrix Eigenvalues Reflect Data Geometry","verification":"informal_only","review":"needs_review"}]},{"topic":"graph-algorithms-essentials","url":"https://theorempath.com/topics/graph-algorithms-essentials","title":"Graph Algorithms Essentials","reviewedOn":"2026-04-26","claims":[{"localId":"dijkstra-correctness","kind":"theorem","title":"Dijkstra's Algorithm Correctness","verification":"informal_only","review":"needs_review"},{"localId":"mst-cut-property","kind":"theorem","title":"MST Cut Property","verification":"informal_only","review":"needs_review"}]},{"topic":"graph-neural-networks","url":"https://theorempath.com/topics/graph-neural-networks","title":"Graph Neural Networks","reviewedOn":"2026-04-26","claims":[{"localId":"gcn-spectral-derivation","kind":"proposition","title":"GCN as First-Order Spectral Approximation","verification":"informal_only","review":"draft"},{"localId":"gnn-wl-expressivity-bound","kind":"theorem","title":"GNN Expressivity Upper Bound via WL Test","verification":"informal_only","review":"needs_review"}]},{"topic":"graph-neural-networks-for-molecules","url":"https://theorempath.com/topics/graph-neural-networks-for-molecules","title":"Graph Neural Networks for Molecules","reviewedOn":"2026-04-26","claims":[{"localId":"mpnn-locality-principle","kind":"proposition","title":"Message Passing Locality","verification":"informal_only","review":"draft"}]},{"topic":"graphslam-and-factor-graphs","url":"https://theorempath.com/topics/graphslam-and-factor-graphs","title":"GraphSLAM and Factor Graphs","reviewedOn":"2026-04-25","claims":[{"localId":"graphslam-map-equivalence","kind":"proposition","title":"GraphSLAM as Nonlinear Least Squares","verification":"informal_only","review":"needs_review"},{"localId":"information-matrix-sparsity","kind":"proposition","title":"Sparsity of the SLAM Information Matrix","verification":"informal_only","review":"needs_review"}]},{"topic":"greedy-algorithms","url":"https://theorempath.com/topics/greedy-algorithms","title":"Greedy Algorithms","reviewedOn":"2026-04-27","claims":[{"localId":"matroid-greedy-optimality","kind":"theorem","title":"Greedy is Optimal on Matroids","verification":"informal_only","review":"needs_review"}]},{"topic":"greg-estimator","url":"https://theorempath.com/topics/greg-estimator","title":"GREG Estimator","reviewedOn":"2026-04-18","claims":[{"localId":"greg-as-quadratic-calibration","kind":"theorem","title":"GREG as Quadratic Calibration Estimator","verification":"informal_only","review":"needs_review"}]},{"topic":"griddy-gibbs","url":"https://theorempath.com/topics/griddy-gibbs","title":"Griddy Gibbs Sampling","reviewedOn":"2026-04-14","claims":[{"localId":"griddy-gibbs-convergence","kind":"proposition","title":"Convergence of Griddy Gibbs","verification":"informal_only","review":"needs_review"}]},{"topic":"grokking","url":"https://theorempath.com/topics/grokking","title":"Grokking","reviewedOn":"2026-04-25","claims":[{"localId":"grokking-phenomenon","kind":"proposition","title":"Grokking: Delayed Generalization","verification":"informal_only","review":"needs_review"},{"localId":"weight-decay-transition","kind":"proposition","title":"Weight Decay as a Sufficient Driver of Grokking","verification":"informal_only","review":"needs_review"}]},{"topic":"hadoop-and-distributed-storage","url":"https://theorempath.com/topics/hadoop-and-distributed-storage","title":"Hadoop and Distributed Storage","reviewedOn":"2026-04-18","claims":[{"localId":"data-locality-principle","kind":"proposition","title":"Data Locality Principle","verification":"informal_only","review":"draft"}]},{"topic":"hallucination-theory","url":"https://theorempath.com/topics/hallucination-theory","title":"Hallucination Theory","reviewedOn":"2026-07-04","claims":[{"localId":"binary-grading-incentive","kind":"proposition","title":"Binary grading makes abstention strictly suboptimal (Kalai-Nachum-Vempala-Zhang 2025, Observation 1)","verification":"informal_only","review":"needs_review"},{"localId":"calibration-sharpness-decomposition","kind":"theorem","title":"Brier score calibration-refinement decomposition (DeGroot-Fienberg 1983)","verification":"informal_only","review":"needs_review"},{"localId":"iiv-reduction","kind":"theorem","title":"Generation-to-classification reduction (Kalai-Nachum-Vempala-Zhang 2025, Theorem 1)","verification":"informal_only","review":"needs_review"},{"localId":"singleton-rate-lower-bound","kind":"theorem","title":"Singleton-rate lower bound on hallucination (Kalai-Nachum-Vempala-Zhang 2025, Theorem 2)","verification":"informal_only","review":"needs_review"}]},{"topic":"hamilton-jacobi-bellman-equation","url":"https://theorempath.com/topics/hamilton-jacobi-bellman-equation","title":"Hamilton–Jacobi–Bellman Equation","reviewedOn":"2026-04-26","claims":[{"localId":"hjb-verification-theorem","kind":"theorem","title":"HJB Verification Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"hamiltonian-monte-carlo","url":"https://theorempath.com/topics/hamiltonian-monte-carlo","title":"Hamiltonian Monte Carlo","reviewedOn":"2026-05-06","claims":[{"localId":"detailed-balance-hmc","kind":"proposition","title":"HMC Satisfies Detailed Balance","verification":"informal_only","review":"draft"},{"localId":"hamiltonian-dynamics-preservation","kind":"theorem","title":"Conservation Properties of Hamiltonian Dynamics","verification":"informal_only","review":"needs_review"},{"localId":"leapfrog-volume-preservation","kind":"proposition","title":"Leapfrog Preserves Volume","verification":"informal_only","review":"needs_review"}]},{"topic":"hanson-wright-inequality","url":"https://theorempath.com/topics/hanson-wright-inequality","title":"Hanson-Wright Inequality","reviewedOn":"2026-04-22","claims":[{"localId":"decoupling-inequality","kind":"lemma","title":"Decoupling Inequality for Quadratic Forms","verification":"informal_only","review":"needs_review"},{"localId":"hanson-wright-inequality","kind":"theorem","title":"Hanson-Wright Inequality","verification":"informal_only","review":"draft"}]},{"topic":"hardware-for-ml-practitioners","url":"https://theorempath.com/topics/hardware-for-ml-practitioners","title":"Hardware for ML Practitioners","reviewedOn":"2026-04-18","claims":[{"localId":"gpu-memory-bottleneck","kind":"proposition","title":"Training Memory Lower Bound","verification":"informal_only","review":"needs_review"}]},{"topic":"hash-functions","url":"https://theorempath.com/topics/hash-functions","title":"Cryptographic Hash Functions","reviewedOn":"2026-04-15","claims":[{"localId":"birthday-bound","kind":"theorem","title":"Birthday Bound on Hash Collisions","verification":"informal_only","review":"needs_review"},{"localId":"merkle-damgard-security","kind":"theorem","title":"Merkle-Damgard Security Reduction","verification":"informal_only","review":"needs_review"}]},{"topic":"hebbian-learning","url":"https://theorempath.com/topics/hebbian-learning","title":"Hebbian Learning","reviewedOn":"2026-04-27","claims":[{"localId":"oja-online-pca-principle","kind":"proposition","title":"Oja Rule as Online PCA","verification":"informal_only","review":"needs_review"}]},{"topic":"high-dimensional-covariance-estimation","url":"https://theorempath.com/topics/high-dimensional-covariance-estimation","title":"High-Dimensional Covariance Estimation","reviewedOn":"2026-04-18","claims":[{"localId":"graphical-lasso-consistency","kind":"theorem","title":"Graphical Lasso Recovers Sparse Precision Matrices","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"ledoit-wolf-optimal-shrinkage","kind":"theorem","title":"Ledoit-Wolf Optimal Shrinkage Intensity","verification":"source_checked","review":"source_checked","sourceRoles":["background"]},{"localId":"sample-covariance-failure","kind":"theorem","title":"Sample Covariance Fails in High Dimensions","verification":"source_checked","review":"source_checked","sourceRoles":["background"]}]},{"topic":"history-of-ai","url":"https://theorempath.com/topics/history-of-ai","title":"History of Artificial Intelligence","reviewedOn":"2026-04-22","claims":[{"localId":"perceptron-convergence-limit","kind":"theorem","title":"Perceptron Limitation (Minsky-Papert 1969)","verification":"informal_only","review":"draft"}]},{"topic":"hoeffdings-lemma","url":"https://theorempath.com/topics/hoeffdings-lemma","title":"Hoeffding's Lemma","reviewedOn":"2026-05-08","claims":[{"localId":"hoeffding-from-hoeffdings-lemma","kind":"corollary","title":"Hoeffding's Inequality from the Lemma","verification":"informal_only","review":"needs_review"},{"localId":"hoeffdings-lemma","kind":"lemma","title":"Hoeffding's Lemma","verification":"informal_only","review":"needs_review"}]},{"topic":"hypergeometric-distribution","url":"https://theorempath.com/topics/hypergeometric-distribution","title":"Hypergeometric Distribution","reviewedOn":"2026-05-12","claims":[{"localId":"hypergeometric-mean-variance","kind":"theorem","title":"Hypergeometric Mean and Variance","verification":"informal_only","review":"needs_review"},{"localId":"hypergeometric-to-binomial-limit","kind":"theorem","title":"Hypergeometric Converges to Binomial as N grows","verification":"informal_only","review":"needs_review"}]},{"topic":"hypothesis-classes-and-function-spaces","url":"https://theorempath.com/topics/hypothesis-classes-and-function-spaces","title":"Hypothesis Classes and Function Spaces","reviewedOn":"2026-04-26","claims":[{"localId":"excess-risk-decomposition","kind":"theorem","title":"Excess Risk Decomposition","verification":"informal_only","review":"needs_review"},{"localId":"nested-class-monotonicity","kind":"proposition","title":"Nested Classes and Monotonicity","verification":"informal_only","review":"needs_review"}]},{"topic":"hypothesis-testing-for-ml","url":"https://theorempath.com/topics/hypothesis-testing-for-ml","title":"Hypothesis Testing for ML","reviewedOn":"2026-04-22","claims":[{"localId":"bonferroni-correction","kind":"theorem","title":"Bonferroni Correction","verification":"source_checked","review":"source_checked","sourceRoles":["historical","proof"]},{"localId":"neyman-pearson-framework","kind":"proposition","title":"Type I and Type II Errors","verification":"source_checked","review":"source_checked","sourceRoles":["historical","proof"]}]},{"topic":"implicit-bias-and-modern-generalization","url":"https://theorempath.com/topics/implicit-bias-and-modern-generalization","title":"Implicit Bias and Modern Generalization","reviewedOn":"2026-04-13","claims":[{"localId":"double-descent-existence","kind":"proposition","title":"Double Descent in Random-Features Linear Regression","verification":"informal_only","review":"needs_review"},{"localId":"implicit-bias-linear-gd","kind":"theorem","title":"Implicit Bias of GD for Linear Models","verification":"informal_only","review":"needs_review"}]},{"topic":"implicit-differentiation","url":"https://theorempath.com/topics/implicit-differentiation","title":"Implicit Differentiation","reviewedOn":"2026-04-13","claims":[{"localId":"argmin-differentiation","kind":"corollary","title":"Differentiation Through Argmin","verification":"informal_only","review":"needs_review"},{"localId":"implicit-function-theorem","kind":"theorem","title":"Implicit Function Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"importance-sampling","url":"https://theorempath.com/topics/importance-sampling","title":"Importance Sampling","reviewedOn":"2026-04-26","claims":[{"localId":"is-unbiasedness","kind":"theorem","title":"Unbiasedness of Importance Sampling","verification":"informal_only","review":"needs_review"},{"localId":"is-variance-bound","kind":"theorem","title":"Optimal Proposal and Variance Lower Bound","verification":"informal_only","review":"needs_review"}]},{"topic":"induction-heads","url":"https://theorempath.com/topics/induction-heads","title":"Induction Heads","reviewedOn":"2026-07-03","claims":[{"localId":"induction-head-mechanism","kind":"proposition","title":"Induction Head Circuit","verification":"informal_only","review":"needs_review"},{"localId":"induction-head-phase-transition","kind":"proposition","title":"Induction Head Phase Transition","verification":"informal_only","review":"needs_review"}]},{"topic":"inference-systems-overview","url":"https://theorempath.com/topics/inference-systems-overview","title":"Inference Systems Overview","reviewedOn":"2026-05-25","claims":[{"localId":"arithmetic-intensity-bound","kind":"proposition","title":"The Arithmetic Intensity Bottleneck","verification":"informal_only","review":"needs_review"},{"localId":"continuous-batching-throughput","kind":"proposition","title":"Throughput Gain from Continuous Batching","verification":"informal_only","review":"draft"}]},{"topic":"inference-time-scaling-laws","url":"https://theorempath.com/topics/inference-time-scaling-laws","title":"Inference-Time Scaling Laws","reviewedOn":"2026-07-03","claims":[{"localId":"best-of-n-scaling-rate","kind":"theorem","title":"Diminishing Returns of Best-of-N","verification":"informal_only","review":"needs_review"}]},{"topic":"information-bottleneck","url":"https://theorempath.com/topics/information-bottleneck","title":"Information Bottleneck","reviewedOn":"2026-04-26","claims":[{"localId":"data-processing-inequality-chain","kind":"theorem","title":"Data Processing Inequality for Layer Representations","verification":"informal_only","review":"needs_review"},{"localId":"ib-lagrangian-optimality","kind":"theorem","title":"Information Bottleneck Optimality Conditions","verification":"informal_only","review":"needs_review"}]},{"topic":"information-geometry","url":"https://theorempath.com/topics/information-geometry","title":"Information Geometry","reviewedOn":"2026-04-26","claims":[{"localId":"fisher-metric-theorem","kind":"theorem","title":"Fisher Metric as KL Hessian","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"natural-gradient-invariance","kind":"theorem","title":"Natural Gradient Invariance","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"information-retrieval","url":"https://theorempath.com/topics/information-retrieval","title":"Information Retrieval Foundations","reviewedOn":"2026-04-15","claims":[{"localId":"probability-ranking-principle","kind":"theorem","title":"Probability Ranking Principle","verification":"informal_only","review":"needs_review"}]},{"topic":"information-theory-foundations","url":"https://theorempath.com/topics/information-theory-foundations","title":"Information Theory Foundations","reviewedOn":"2026-04-13","claims":[{"localId":"chain-rule-entropy","kind":"theorem","title":"Chain Rule for Entropy","verification":"informal_only","review":"draft"},{"localId":"data-processing-inequality","kind":"theorem","title":"Data Processing Inequality","verification":"informal_only","review":"needs_review"},{"localId":"gibbs-inequality","kind":"theorem","title":"Gibbs Inequality (Non-Negativity of KL)","verification":"informal_only","review":"needs_review"}]},{"topic":"inner-product-spaces-and-orthogonality","url":"https://theorempath.com/topics/inner-product-spaces-and-orthogonality","title":"Inner Product Spaces and Orthogonality","reviewedOn":"2026-04-26","claims":[{"localId":"cauchy-schwarz-inequality","kind":"theorem","title":"Cauchy-Schwarz Inequality","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"integration-and-change-of-variables","url":"https://theorempath.com/topics/integration-and-change-of-variables","title":"Integration and Change of Variables","reviewedOn":"2026-04-26","claims":[{"localId":"change-of-variables-formula","kind":"theorem","title":"Change of Variables Formula","verification":"informal_only","review":"draft"},{"localId":"fubini-theorem","kind":"theorem","title":"Fubini's Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"interior-point-methods","url":"https://theorempath.com/topics/interior-point-methods","title":"Interior Point Methods","reviewedOn":"2026-04-14","claims":[{"localId":"barrier-method-convergence","kind":"theorem","title":"Convergence of the Barrier Method","verification":"informal_only","review":"needs_review"}]},{"topic":"inverse-and-implicit-function-theorem","url":"https://theorempath.com/topics/inverse-and-implicit-function-theorem","title":"Inverse and Implicit Function Theorem","reviewedOn":"2026-04-26","claims":[{"localId":"implicit-function-theorem","kind":"theorem","title":"Implicit Function Theorem","verification":"informal_only","review":"needs_review"},{"localId":"inverse-function-theorem","kind":"theorem","title":"Inverse Function Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"iterative-magnitude-pruning-and-lottery-ticket-hypothesis","url":"https://theorempath.com/topics/iterative-magnitude-pruning-and-lottery-ticket-hypothesis","title":"Iterative Magnitude Pruning and the Lottery Ticket Hypothesis","reviewedOn":"2026-04-25","claims":[{"localId":"imp-is-a-search-procedure","kind":"proposition","title":"IMP is a search procedure, not a free training shortcut","verification":"informal_only","review":"needs_review"},{"localId":"mask-restricted-gradient-flow","kind":"proposition","title":"Masked training stays inside the sparse subspace","verification":"informal_only","review":"needs_review"}]},{"topic":"ito-lemma","url":"https://theorempath.com/topics/ito-lemma","title":"Ito's Lemma","reviewedOn":"2026-04-18","claims":[{"localId":"ito-isometry","kind":"theorem","title":"Ito Isometry","verification":"informal_only","review":"needs_review"},{"localId":"ito-lemma-multidimensional","kind":"theorem","title":"Multidimensional Ito's Lemma","verification":"informal_only","review":"draft"},{"localId":"ito-lemma-one-dimensional","kind":"theorem","title":"Ito's Lemma (One Dimension)","verification":"informal_only","review":"needs_review"}]},{"topic":"jepa-and-joint-embedding","url":"https://theorempath.com/topics/jepa-and-joint-embedding","title":"JEPA and Joint Embedding","reviewedOn":"2026-05-29","claims":[{"localId":"jepa-energy-objective","kind":"proposition","title":"JEPA as Energy-Based Learning","verification":"informal_only","review":"draft"}]},{"topic":"joint-marginal-conditional-distributions","url":"https://theorempath.com/topics/joint-marginal-conditional-distributions","title":"Joint, Marginal, and Conditional Distributions","reviewedOn":"2026-04-26","claims":[{"localId":"bayes-theorem","kind":"theorem","title":"Bayes Theorem","verification":"informal_only","review":"draft"}]},{"topic":"k-means-clustering","url":"https://theorempath.com/topics/k-means-clustering","title":"K-Means Clustering","reviewedOn":"2026-04-13","claims":[{"localId":"kmeans-convergence","kind":"theorem","title":"K-Means Convergence","verification":"informal_only","review":"needs_review"},{"localId":"kmeans-plus-plus-guarantee","kind":"theorem","title":"K-Means++ Approximation Guarantee","verification":"informal_only","review":"needs_review"}]},{"topic":"kalman-filter","url":"https://theorempath.com/topics/kalman-filter","title":"Kalman Filter","reviewedOn":"2026-04-26","claims":[{"localId":"kalman-optimality","kind":"theorem","title":"Optimality of the Kalman Filter","verification":"informal_only","review":"needs_review"}]},{"topic":"kelly-criterion","url":"https://theorempath.com/topics/kelly-criterion","title":"Kelly Criterion","reviewedOn":"2026-04-15","claims":[{"localId":"kelly-optimality","kind":"theorem","title":"Kelly Criterion Optimality","verification":"informal_only","review":"needs_review"},{"localId":"kelly-ruin-boundary","kind":"proposition","title":"Over-Kelly Ruin","verification":"informal_only","review":"needs_review"}]},{"topic":"kernel-density-estimation","url":"https://theorempath.com/topics/kernel-density-estimation","title":"Kernel Density Estimation","reviewedOn":"2026-05-13","claims":[{"localId":"kde-mise-rate","kind":"theorem","title":"Asymptotic MISE for KDE","verification":"informal_only","review":"needs_review"}]},{"topic":"kernel-methods-for-molecules","url":"https://theorempath.com/topics/kernel-methods-for-molecules","title":"Kernel Methods for Molecules","reviewedOn":"2026-04-18","claims":[{"localId":"kernel-small-data-prior","kind":"proposition","title":"Small-Data Prior Advantage","verification":"informal_only","review":"draft"}]},{"topic":"kernel-trick","url":"https://theorempath.com/topics/kernel-trick","title":"The Kernel Trick","reviewedOn":"2026-05-10","claims":[{"localId":"mercer-condition-trick","kind":"theorem","title":"Mercer's Condition for Validity of a Kernel","verification":"informal_only","review":"needs_review"},{"localId":"polynomial-kernel-inner-product","kind":"theorem","title":"Polynomial Kernel Equals Inner Product in a Polynomial Feature Space","verification":"informal_only","review":"needs_review"}]},{"topic":"kernel-two-sample-tests","url":"https://theorempath.com/topics/kernel-two-sample-tests","title":"Kernel Two-Sample Tests","reviewedOn":"2026-07-26","claims":[{"localId":"mmd-characterization","kind":"theorem","title":"MMD as RKHS Distance Between Mean Embeddings","verification":"informal_only","review":"needs_review"},{"localId":"mmd-test-power","kind":"proposition","title":"MMD Test Has Power Against All Alternatives","verification":"informal_only","review":"needs_review"},{"localId":"mmd-unbiased-estimator","kind":"theorem","title":"Unbiased U-Statistic Estimator of MMD Squared","verification":"informal_only","review":"needs_review"}]},{"topic":"kernels-and-rkhs","url":"https://theorempath.com/topics/kernels-and-rkhs","title":"Kernels and Reproducing Kernel Hilbert Spaces","reviewedOn":"2026-04-13","claims":[{"localId":"mercer-theorem","kind":"theorem","title":"Mercer's Theorem","verification":"informal_only","review":"needs_review"},{"localId":"representer-theorem","kind":"theorem","title":"The Representer Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"kl-divergence","url":"https://theorempath.com/topics/kl-divergence","title":"KL Divergence","reviewedOn":"2026-04-26","claims":[{"localId":"gibbs-inequality","kind":"theorem","title":"Gibbs Inequality (Non-negativity of KL Divergence)","verification":"informal_only","review":"needs_review"}]},{"topic":"knapsack-problem","url":"https://theorempath.com/topics/knapsack-problem","title":"Knapsack Problem","reviewedOn":"2026-04-26","claims":[{"localId":"fractional-knapsack-optimality","kind":"theorem","title":"Greedy Optimality for Fractional Knapsack","verification":"informal_only","review":"needs_review"},{"localId":"knapsack-dp-correctness","kind":"theorem","title":"0/1 Knapsack DP Solution","verification":"informal_only","review":"needs_review"},{"localId":"knapsack-fptas","kind":"theorem","title":"FPTAS for 0/1 Knapsack","verification":"informal_only","review":"needs_review"}]},{"topic":"knn","url":"https://theorempath.com/topics/knn","title":"K-Nearest Neighbors","reviewedOn":"2026-04-13","claims":[{"localId":"1nn-error-bound","kind":"theorem","title":"1-NN Error Bound (Cover and Hart)","verification":"informal_only","review":"needs_review"},{"localId":"knn-universal-consistency","kind":"theorem","title":"Universal Consistency of KNN (Stone's Theorem)","verification":"informal_only","review":"needs_review"}]},{"topic":"knowledge-distillation","url":"https://theorempath.com/topics/knowledge-distillation","title":"Knowledge Distillation","reviewedOn":"2026-04-26","claims":[{"localId":"distillation-loss-decomposition","kind":"proposition","title":"Distillation Gradient at High Temperature","verification":"informal_only","review":"needs_review"}]},{"topic":"kolmogorov-arnold-networks","url":"https://theorempath.com/topics/kolmogorov-arnold-networks","title":"Kolmogorov-Arnold Networks (KANs)","reviewedOn":"2026-05-27","claims":[{"localId":"kan-approximation-bound","kind":"theorem","title":"KAN Approximation Bound (Liu et al. 2024)","verification":"informal_only","review":"needs_review"},{"localId":"kolmogorov-arnold-representation","kind":"theorem","title":"Kolmogorov-Arnold Representation (1957)","verification":"informal_only","review":"needs_review"}]},{"topic":"kolmogorov-complexity-and-mdl","url":"https://theorempath.com/topics/kolmogorov-complexity-and-mdl","title":"Kolmogorov Complexity and MDL","reviewedOn":"2026-04-26","claims":[{"localId":"kolmogorov-incomputability","kind":"theorem","title":"Incomputability of Kolmogorov Complexity","verification":"informal_only","review":"needs_review"},{"localId":"mdl-consistency","kind":"theorem","title":"MDL Consistency","verification":"informal_only","review":"needs_review"}]},{"topic":"kolmogorov-probability-axioms","url":"https://theorempath.com/topics/kolmogorov-probability-axioms","title":"Kolmogorov Probability Axioms","reviewedOn":"2026-04-28","claims":[{"localId":"inclusion-exclusion-formula","kind":"theorem","title":"Inclusion-Exclusion Principle","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"kolmogorov-axioms","kind":"theorem","title":"Kolmogorov Axioms of Probability","verification":"source_checked","review":"source_checked","sourceRoles":["definition"]},{"localId":"probability-continuity-from-below","kind":"theorem","title":"Continuity of Probability Measures","verification":"informal_only","review":"needs_review"},{"localId":"probability-measure-basic-identities","kind":"proposition","title":"Basic Identities of Probability Measures","verification":"lean_verified","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"probability-measure-complement-rule","kind":"proposition","title":"Complement Rule for Probability Measures","verification":"lean_verified","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"probability-measure-continuity-from-above","kind":"theorem","title":"Continuity from Above for Probability Measures","verification":"lean_verified","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"probability-measure-continuity-from-below","kind":"theorem","title":"Continuity from Below for Probability Measures","verification":"lean_verified","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"probability-measure-countable-additivity","kind":"theorem","title":"Countable Additivity for Probability Measures","verification":"lean_verified","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"probability-measure-countable-union-bound","kind":"theorem","title":"Countable Union Bound for Probability Measures","verification":"lean_verified","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"probability-measure-finite-additivity","kind":"proposition","title":"Finite Additivity for Probability Measures","verification":"lean_verified","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"probability-measure-finite-union-bound","kind":"theorem","title":"Finite Union Bound for Probability Measures","verification":"lean_verified","review":"source_checked","sourceRoles":["background","proof"]}]},{"topic":"kv-cache","url":"https://theorempath.com/topics/kv-cache","title":"KV Cache","reviewedOn":"2026-04-26","claims":[{"localId":"kv-cache-complexity","kind":"proposition","title":"KV Cache Reduces Per-Step Compute from O(td) to O(d)","verification":"informal_only","review":"needs_review"},{"localId":"mqa-memory-reduction","kind":"proposition","title":"MQA Reduces KV Cache by Factor h","verification":"informal_only","review":"draft"}]},{"topic":"kv-cache-optimization","url":"https://theorempath.com/topics/kv-cache-optimization","title":"KV Cache Optimization","reviewedOn":"2026-05-25","claims":[{"localId":"paged-attention-utilization","kind":"proposition","title":"Paged Attention Achieves Near-Optimal Memory Utilization","verification":"informal_only","review":"needs_review"},{"localId":"prefix-cache-hit-rate","kind":"proposition","title":"Prefix Sharing Reduces Memory Proportional to Shared Length","verification":"informal_only","review":"needs_review"}]},{"topic":"label-smoothing-and-regularization","url":"https://theorempath.com/topics/label-smoothing-and-regularization","title":"Label Smoothing and Regularization","reviewedOn":"2026-04-26","claims":[{"localId":"label-smoothing-as-kl-regularization","kind":"proposition","title":"Label Smoothing as KL Regularization","verification":"informal_only","review":"draft"}]},{"topic":"langevin-dynamics","url":"https://theorempath.com/topics/langevin-dynamics","title":"Langevin Dynamics","reviewedOn":"2026-04-18","claims":[{"localId":"dalalyan-non-asymptotic-ula-bound","kind":"theorem","title":"Dalalyan's Non-Asymptotic ULA Bound","verification":"informal_only","review":"needs_review"},{"localId":"gibbs-stationary-distribution-langevin","kind":"theorem","title":"Gibbs Measure is the Stationary Distribution of Langevin","verification":"informal_only","review":"needs_review"}]},{"topic":"lasso-regression","url":"https://theorempath.com/topics/lasso-regression","title":"Lasso Regression","reviewedOn":"2026-04-26","claims":[{"localId":"lasso-kkt-conditions","kind":"theorem","title":"Lasso KKT Conditions","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"lasso-sparsity-theorem","kind":"proposition","title":"Lasso Produces Sparse Solutions","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"latent-reasoning","url":"https://theorempath.com/topics/latent-reasoning","title":"Latent Reasoning","reviewedOn":"2026-05-29","claims":[{"localId":"latent-depth-expressiveness","kind":"proposition","title":"CoT Lifts Transformer Expressivity","verification":"informal_only","review":"needs_review"},{"localId":"looped-transformer-simulation","kind":"proposition","title":"Looped Transformers Simulate Turing Machines","verification":"informal_only","review":"draft"}]},{"topic":"law-of-large-numbers","url":"https://theorempath.com/topics/law-of-large-numbers","title":"Law of Large Numbers","reviewedOn":"2026-04-23","claims":[{"localId":"strong-law-of-large-numbers","kind":"theorem","title":"Strong Law of Large Numbers (SLLN)","verification":"lean_verified","review":"needs_review"},{"localId":"weak-law-of-large-numbers","kind":"theorem","title":"Weak Law of Large Numbers (WLLN)","verification":"lean_verified","review":"needs_review"}]},{"topic":"lazy-vs-feature-learning","url":"https://theorempath.com/topics/lazy-vs-feature-learning","title":"Lazy vs Feature Learning","reviewedOn":"2026-04-26","claims":[{"localId":"feature-learning-separation","kind":"proposition","title":"Feature Learning Separation","verification":"informal_only","review":"needs_review"},{"localId":"lazy-regime-linearization","kind":"theorem","title":"Lazy Regime via Large Width","verification":"informal_only","review":"needs_review"}]},{"topic":"learning-rate-scheduling","url":"https://theorempath.com/topics/learning-rate-scheduling","title":"Learning Rate Scheduling","reviewedOn":"2026-04-26","claims":[{"localId":"lr-convergence-rate","kind":"theorem","title":"Convergence Rate with Decaying Learning Rate","verification":"informal_only","review":"needs_review"}]},{"topic":"leverage-points-systems","url":"https://theorempath.com/topics/leverage-points-systems","title":"Leverage Points in Complex Systems","reviewedOn":"2026-04-15","claims":[{"localId":"leverage-point-hierarchy","kind":"proposition","title":"Leverage Point Ordering Principle","verification":"informal_only","review":"needs_review"}]},{"topic":"likelihood-ratio-wald-score-tests","url":"https://theorempath.com/topics/likelihood-ratio-wald-score-tests","title":"Likelihood-Ratio, Wald, and Score Tests","reviewedOn":"2026-05-11","claims":[{"localId":"score-test-asymptotics","kind":"theorem","title":"Score (Rao) Test Asymptotics","verification":"informal_only","review":"draft"},{"localId":"trinity-asymptotic-equivalence","kind":"theorem","title":"Asymptotic Equivalence of the Trinity","verification":"informal_only","review":"needs_review"},{"localId":"wald-test-asymptotics","kind":"theorem","title":"Wald Test Asymptotics","verification":"informal_only","review":"needs_review"},{"localId":"wilks-likelihood-ratio-asymptotics","kind":"theorem","title":"Wilks's Likelihood-Ratio Asymptotics","verification":"informal_only","review":"needs_review"}]},{"topic":"line-search-methods","url":"https://theorempath.com/topics/line-search-methods","title":"Line Search Methods","reviewedOn":"2026-04-25","claims":[{"localId":"armijo-backtracking-convergence","kind":"theorem","title":"Gradient Descent With Backtracking Reaches Stationary Points","verification":"informal_only","review":"needs_review"},{"localId":"armijo-existence","kind":"lemma","title":"Armijo Steps Exist For Descent Directions","verification":"informal_only","review":"needs_review"},{"localId":"zoutendijk-theorem","kind":"theorem","title":"Zoutendijk Condition","verification":"informal_only","review":"needs_review"}]},{"topic":"linear-independence","url":"https://theorempath.com/topics/linear-independence","title":"Linear Independence","reviewedOn":"2026-05-01","claims":[{"localId":"linear-independence-equivalences","kind":"theorem","title":"Equivalent Tests for Linear Independence","verification":"informal_only","review":"needs_review"},{"localId":"max-independent-vectors-in-rn","kind":"theorem","title":"At Most n Independent Vectors in R^n","verification":"informal_only","review":"needs_review"}]},{"topic":"linear-layer-shapes-memory","url":"https://theorempath.com/topics/linear-layer-shapes-memory","title":"Linear Layer: Shapes, Bias, and Memory","reviewedOn":"2026-05-01","claims":[{"localId":"linear-layer-backward-pass","kind":"proposition","title":"Linear Layer Backward Pass","verification":"informal_only","review":"needs_review"}]},{"topic":"linear-regression","url":"https://theorempath.com/topics/linear-regression","title":"Linear Regression","reviewedOn":"2026-05-04","claims":[{"localId":"gauss-markov-theorem","kind":"theorem","title":"Gauss-Markov Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"llama-and-open-weight-models","url":"https://theorempath.com/topics/llama-and-open-weight-models","title":"LLaMA and Open Weight Models","reviewedOn":"2026-05-31","claims":[{"localId":"quantization-error-bound","kind":"proposition","title":"Quantization Error for Uniform Scalar Quantization","verification":"informal_only","review":"needs_review"}]},{"topic":"llm-application-security","url":"https://theorempath.com/topics/llm-application-security","title":"LLM Application Security","reviewedOn":"2026-05-31","claims":[{"localId":"llm-instruction-data-conflation","kind":"proposition","title":"Instruction-Data Conflation","verification":"informal_only","review":"needs_review"}]},{"topic":"lln-failures-heavy-tails","url":"https://theorempath.com/topics/lln-failures-heavy-tails","title":"LLN and CLT Failures Under Heavy Tails","reviewedOn":"2026-05-12","claims":[{"localId":"cauchy-sample-mean-stays-cauchy","kind":"theorem","title":"Sample Mean of i.i.d. Cauchy is Again Cauchy","verification":"informal_only","review":"needs_review"},{"localId":"generalized-clt-stable-laws","kind":"theorem","title":"Generalized CLT (Levy-Gnedenko)","verification":"informal_only","review":"needs_review"}]},{"topic":"local-polynomial-regression","url":"https://theorempath.com/topics/local-polynomial-regression","title":"Local Polynomial Regression","reviewedOn":"2026-05-13","claims":[{"localId":"local-linear-bias-variance","kind":"theorem","title":"Asymptotic Pointwise MSE for Local Linear Regression","verification":"informal_only","review":"needs_review"}]},{"topic":"log-probability-computation","url":"https://theorempath.com/topics/log-probability-computation","title":"Log-Probability Computation","reviewedOn":"2026-04-22","claims":[{"localId":"log-sum-exp-stability","kind":"proposition","title":"Numerical Stability of Log-Sum-Exp","verification":"informal_only","review":"needs_review"}]},{"topic":"logistic-regression","url":"https://theorempath.com/topics/logistic-regression","title":"Logistic Regression","reviewedOn":"2026-04-26","claims":[{"localId":"logistic-regression-convexity","kind":"theorem","title":"Convexity of Logistic Regression Loss","verification":"informal_only","review":"needs_review"},{"localId":"logistic-regression-gradient","kind":"theorem","title":"Gradient of Logistic Regression Loss","verification":"informal_only","review":"needs_review"}]},{"topic":"lognormal-distribution","url":"https://theorempath.com/topics/lognormal-distribution","title":"Lognormal Distribution","reviewedOn":"2026-05-12","claims":[{"localId":"lognormal-moments","kind":"theorem","title":"Lognormal Mean, Variance, Median, Mode","verification":"informal_only","review":"needs_review"},{"localId":"multiplicative-clt-to-lognormal","kind":"theorem","title":"Product of Independent Positive r.v.s converges to Lognormal","verification":"informal_only","review":"needs_review"}]},{"topic":"logsplines","url":"https://theorempath.com/topics/logsplines","title":"Logspline Density Estimation","reviewedOn":"2026-04-26","claims":[{"localId":"logspline-consistency","kind":"theorem","title":"Logspline Consistency","verification":"informal_only","review":"needs_review"},{"localId":"logspline-exponential-family","kind":"proposition","title":"Logsplines as Exponential Families","verification":"informal_only","review":"needs_review"}]},{"topic":"longitudinal-surveys-and-panel-data","url":"https://theorempath.com/topics/longitudinal-surveys-and-panel-data","title":"Longitudinal Surveys and Panel Data","reviewedOn":"2026-04-26","claims":[{"localId":"fixed-effects-within-estimator","kind":"theorem","title":"Consistency of the Fixed Effects Estimator","verification":"informal_only","review":"needs_review"}]},{"topic":"loss-functions","url":"https://theorempath.com/topics/loss-functions","title":"Loss Functions","reviewedOn":"2026-05-08","claims":[{"localId":"mae-minimizer-conditional-median","kind":"theorem","title":"MAE minimizer is the conditional median","verification":"informal_only","review":"needs_review"},{"localId":"mse-minimizer-conditional-mean","kind":"theorem","title":"MSE minimizer is the conditional mean","verification":"informal_only","review":"draft"}]},{"topic":"loss-functions-catalog","url":"https://theorempath.com/topics/loss-functions-catalog","title":"Loss Functions Catalog","reviewedOn":"2026-04-14","claims":[{"localId":"cross-entropy-mle-equivalence","kind":"theorem","title":"Cross-Entropy Minimization Equals Maximum Likelihood","verification":"informal_only","review":"needs_review"},{"localId":"huber-loss-robustness","kind":"proposition","title":"Huber Loss Bounded Influence Function","verification":"informal_only","review":"needs_review"}]},{"topic":"mamba-and-state-space-models","url":"https://theorempath.com/topics/mamba-and-state-space-models","title":"Mamba and State-Space Models","reviewedOn":"2026-05-26","claims":[{"localId":"hippo-memory-optimality","kind":"theorem","title":"HiPPO: Optimal Polynomial Memory","verification":"informal_only","review":"needs_review"},{"localId":"selective-ssm-gating","kind":"proposition","title":"Selective State-Space Model (Mamba)","verification":"informal_only","review":"needs_review"},{"localId":"ssm-convolution-equivalence","kind":"theorem","title":"SSM as Global Convolution","verification":"informal_only","review":"needs_review"}]},{"topic":"markov-chain-monte-carlo","url":"https://theorempath.com/topics/markov-chain-monte-carlo","title":"Markov Chain Monte Carlo","reviewedOn":"2026-05-06","claims":[{"localId":"mcmc-ergodic-theorem","kind":"theorem","title":"MCMC Ergodic Theorem","verification":"informal_only","review":"needs_review"},{"localId":"mcmc-stationarity-from-detailed-balance","kind":"theorem","title":"Detailed Balance Implies Stationarity","verification":"informal_only","review":"needs_review"}]},{"topic":"markov-chains-and-steady-state","url":"https://theorempath.com/topics/markov-chains-and-steady-state","title":"Markov Chains and Steady State","reviewedOn":"2026-04-26","claims":[{"localId":"ergodic-theorem-mc","kind":"theorem","title":"Ergodic Theorem for Markov Chains","verification":"informal_only","review":"needs_review"},{"localId":"perron-frobenius-stochastic","kind":"theorem","title":"Perron-Frobenius for Stochastic Matrices","verification":"informal_only","review":"needs_review"}]},{"topic":"markov-decision-processes","url":"https://theorempath.com/topics/markov-decision-processes","title":"Markov Decision Processes","reviewedOn":"2026-04-17","claims":[{"localId":"bellman-contraction-theorem","kind":"theorem","title":"Bellman Operator is a Contraction","verification":"informal_only","review":"needs_review"},{"localId":"bellman-expectation-equation","kind":"theorem","title":"Bellman Expectation Equation","verification":"informal_only","review":"needs_review"},{"localId":"bellman-optimality-equation","kind":"theorem","title":"Bellman Optimality Equation","verification":"informal_only","review":"needs_review"},{"localId":"policy-improvement-theorem","kind":"theorem","title":"Policy Improvement Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"markov-games-and-self-play","url":"https://theorempath.com/topics/markov-games-and-self-play","title":"Markov Games and Self-Play","reviewedOn":"2026-04-18","claims":[{"localId":"minimax-theorem-markov-games","kind":"theorem","title":"Minimax Theorem for Zero-Sum Markov Games","verification":"informal_only","review":"needs_review"}]},{"topic":"mars-multivariate-adaptive-regression-splines","url":"https://theorempath.com/topics/mars-multivariate-adaptive-regression-splines","title":"MARS (Multivariate Adaptive Regression Splines)","reviewedOn":"2026-04-13","claims":[{"localId":"mars-approximation","kind":"proposition","title":"MARS Approximation Rate","verification":"informal_only","review":"needs_review"}]},{"topic":"martingale-theory","url":"https://theorempath.com/topics/martingale-theory","title":"Martingale Theory","reviewedOn":"2026-04-26","claims":[{"localId":"azuma-hoeffding","kind":"theorem","title":"Azuma-Hoeffding Inequality","verification":"lean_verified","review":"source_checked","sourceRoles":["proof"]},{"localId":"doob-lp-maximal-inequality","kind":"theorem","title":"Doob's L^p Maximal Inequality","verification":"informal_only","review":"needs_review"},{"localId":"doob-weak-maximal-inequality","kind":"theorem","title":"Doob's Weak Maximal Inequality","verification":"lean_verified","review":"draft"},{"localId":"freedman-inequality","kind":"theorem","title":"Freedman Inequality","verification":"informal_only","review":"draft"},{"localId":"martingale-convergence","kind":"theorem","title":"Doob's Martingale Convergence Theorem","verification":"informal_only","review":"needs_review"},{"localId":"optional-stopping","kind":"theorem","title":"Optional Stopping Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"matrix-calculus","url":"https://theorempath.com/topics/matrix-calculus","title":"Matrix Calculus","reviewedOn":"2026-07-03","claims":[{"localId":"matrix-chain-rule","kind":"proposition","title":"Chain Rule for Matrix-to-Scalar Functions","verification":"informal_only","review":"needs_review"}]},{"topic":"matrix-concentration","url":"https://theorempath.com/topics/matrix-concentration","title":"Matrix Concentration","reviewedOn":"2026-05-05","claims":[{"localId":"davis-kahan-sin-theta","kind":"theorem","title":"Davis-Kahan Sin-Theta Theorem (Yu-Wang-Samworth variant)","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"intrinsic-dimension-bernstein","kind":"theorem","title":"Intrinsic-Dimension Matrix Bernstein","verification":"informal_only","review":"draft"},{"localId":"matrix-bernstein-inequality","kind":"theorem","title":"Matrix Bernstein Inequality","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"matrix-chernoff","kind":"theorem","title":"Matrix Chernoff Inequality","verification":"informal_only","review":"draft"},{"localId":"matrix-hoeffding","kind":"theorem","title":"Matrix Hoeffding Inequality","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"weyl-inequality","kind":"theorem","title":"Weyl's Inequality","verification":"source_checked","review":"source_checked","sourceRoles":["background"]}]},{"topic":"matrix-multiplication-algorithms","url":"https://theorempath.com/topics/matrix-multiplication-algorithms","title":"Matrix Multiplication Algorithms","reviewedOn":"2026-04-26","claims":[{"localId":"omega-lower-bound","kind":"theorem","title":"Lower Bound on Matrix Multiplication Exponent","verification":"informal_only","review":"needs_review"},{"localId":"strassen-complexity","kind":"theorem","title":"Strassen Algorithm Complexity","verification":"informal_only","review":"needs_review"}]},{"topic":"matrix-norms","url":"https://theorempath.com/topics/matrix-norms","title":"Matrix Norms","reviewedOn":"2026-04-22","claims":[{"localId":"submultiplicativity","kind":"theorem","title":"Submultiplicativity of Matrix Norms","verification":"informal_only","review":"needs_review"}]},{"topic":"matrix-operations-and-properties","url":"https://theorempath.com/topics/matrix-operations-and-properties","title":"Matrix Operations and Properties","reviewedOn":"2026-04-26","claims":[{"localId":"sherman-morrison-woodbury","kind":"theorem","title":"Sherman-Morrison-Woodbury Formula","verification":"informal_only","review":"draft"}]},{"topic":"maximum-a-posteriori-estimation","url":"https://theorempath.com/topics/maximum-a-posteriori-estimation","title":"Maximum A Posteriori (MAP) Estimation","reviewedOn":"2026-05-10","claims":[{"localId":"lasso-equals-laplace-prior-map","kind":"theorem","title":"Lasso Regression as MAP under a Laplace Prior","verification":"informal_only","review":"needs_review"},{"localId":"map-as-penalized-mle","kind":"proposition","title":"MAP as Penalized MLE","verification":"informal_only","review":"needs_review"},{"localId":"ridge-equals-gaussian-prior-map","kind":"theorem","title":"Ridge Regression as MAP under a Gaussian Prior","verification":"informal_only","review":"needs_review"}]},{"topic":"maximum-likelihood-estimation","url":"https://theorempath.com/topics/maximum-likelihood-estimation","title":"Maximum Likelihood Estimation: Theory, Information Identity, and Asymptotic Efficiency","reviewedOn":"2026-05-04","claims":[{"localId":"bartlett-identities","kind":"theorem","title":"Bartlett Identities (Information Equality)","verification":"source_checked","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"cramer-rao-lower-bound","kind":"theorem","title":"Cramér-Rao Lower Bound","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"mle-asymptotic-normality","kind":"theorem","title":"Asymptotic Normality of the MLE","verification":"source_checked","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"mle-consistency","kind":"theorem","title":"Consistency of the MLE (Wald)","verification":"source_checked","review":"source_checked","sourceRoles":["historical","proof"]},{"localId":"qmle-sandwich-variance","kind":"theorem","title":"Quasi-MLE under Misspecification (White)","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"wilks-theorem","kind":"theorem","title":"Wilks' Theorem (LRT Asymptotic χ²)","verification":"source_checked","review":"source_checked","sourceRoles":["historical","proof"]}]},{"topic":"mcdiarmids-inequality","url":"https://theorempath.com/topics/mcdiarmids-inequality","title":"McDiarmid's Inequality","reviewedOn":"2026-04-13","claims":[{"localId":"mcdiarmid-inequality","kind":"theorem","title":"McDiarmid's Inequality (Bounded Differences)","verification":"informal_only","review":"needs_review"}]},{"topic":"mcmc-for-markov-random-fields","url":"https://theorempath.com/topics/mcmc-for-markov-random-fields","title":"MCMC for Markov Random Fields","reviewedOn":"2026-04-25","claims":[{"localId":"hammersley-clifford-theorem","kind":"theorem","title":"Hammersley-Clifford Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"mean-field-games","url":"https://theorempath.com/topics/mean-field-games","title":"Mean-Field Games","reviewedOn":"2026-04-18","claims":[{"localId":"mfg-fixed-point","kind":"theorem","title":"Existence of Mean-Field Equilibrium","verification":"informal_only","review":"needs_review"},{"localId":"mfg-n-player-approximation","kind":"theorem","title":"N-Player Approximation by MFE","verification":"informal_only","review":"needs_review"}]},{"topic":"mean-field-theory","url":"https://theorempath.com/topics/mean-field-theory","title":"Mean Field Theory","reviewedOn":"2026-04-26","claims":[{"localId":"mean-field-limit","kind":"theorem","title":"Mean Field Limit for Two-Layer Networks","verification":"informal_only","review":"needs_review"},{"localId":"wasserstein-gradient-flow","kind":"proposition","title":"Training Loss Decreases Along Wasserstein Gradient Flow","verification":"informal_only","review":"needs_review"}]},{"topic":"measure-concentration-and-geometric-fa","url":"https://theorempath.com/topics/measure-concentration-and-geometric-fa","title":"Measure Concentration and Geometric Functional Analysis","reviewedOn":"2026-09-14","claims":[{"localId":"gaussian-lipschitz-concentration","kind":"theorem","title":"Gaussian Concentration of Lipschitz Functions","verification":"informal_only","review":"needs_review"},{"localId":"johnson-lindenstrauss-lemma","kind":"lemma","title":"Johnson-Lindenstrauss Lemma","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"levy-lemma","kind":"lemma","title":"Levy's Lemma (Concentration on the Sphere)","verification":"informal_only","review":"needs_review"}]},{"topic":"measure-theoretic-probability","url":"https://theorempath.com/topics/measure-theoretic-probability","title":"Measure-Theoretic Probability","reviewedOn":"2026-08-01","claims":[{"localId":"borel-cantelli-first","kind":"lemma","title":"First Borel-Cantelli Lemma","verification":"lean_verified","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"borel-cantelli-second","kind":"lemma","title":"Second Borel-Cantelli Lemma","verification":"lean_verified","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"dominated-convergence-theorem","kind":"theorem","title":"Dominated Convergence Theorem (DCT)","verification":"lean_verified","review":"source_checked","sourceRoles":["background","proof"]},{"localId":"fatou-lemma","kind":"lemma","title":"Fatou's Lemma","verification":"lean_verified","review":"source_checked","sourceRoles":["proof"]},{"localId":"frostman-lemma","kind":"lemma","title":"Frostman's Lemma and Mass Distribution Converse","verification":"informal_only","review":"needs_review"},{"localId":"monotone-convergence-theorem","kind":"theorem","title":"Monotone Convergence Theorem (MCT)","verification":"lean_verified","review":"source_checked","sourceRoles":["background","proof"]}]},{"topic":"mechanism-design","url":"https://theorempath.com/topics/mechanism-design","title":"Mechanism Design","reviewedOn":"2026-04-26","claims":[{"localId":"myerson-optimal-auction","kind":"theorem","title":"Myerson Optimal Auction Theorem (1981)","verification":"informal_only","review":"needs_review"},{"localId":"revelation-principle","kind":"theorem","title":"The Revelation Principle","verification":"informal_only","review":"needs_review"},{"localId":"vcg-dsic","kind":"theorem","title":"VCG is DSIC and Efficient","verification":"informal_only","review":"needs_review"}]},{"topic":"mechanistic-interpretability","url":"https://theorempath.com/topics/mechanistic-interpretability","title":"Mechanistic Interpretability: Features, Circuits, and Causal Faithfulness","reviewedOn":"2026-07-03","claims":[{"localId":"activation-patching-validity","kind":"proposition","title":"Activation Patching Validity (Heimersheim & Nanda 2024)","verification":"informal_only","review":"draft"},{"localId":"linear-probing-bound","kind":"proposition","title":"Linear Probing Bound","verification":"informal_only","review":"needs_review"},{"localId":"linear-representation-hypothesis","kind":"proposition","title":"Linear Representation Hypothesis (working framework)","verification":"informal_only","review":"needs_review"},{"localId":"sparse-feature-circuits","kind":"proposition","title":"Sparse Feature Circuits (Marks et al. 2024)","verification":"informal_only","review":"needs_review"},{"localId":"superposition-geometry","kind":"proposition","title":"Geometry of Superposition","verification":"informal_only","review":"needs_review"}]},{"topic":"megakernels","url":"https://theorempath.com/topics/megakernels","title":"Megakernels","reviewedOn":"2026-05-29","claims":[{"localId":"megakernel-launch-savings","kind":"proposition","title":"Latency Floor from Kernel Launches","verification":"informal_only","review":"needs_review"}]},{"topic":"memory-systems-for-llms","url":"https://theorempath.com/topics/memory-systems-for-llms","title":"Memory Systems for LLMs","reviewedOn":"2026-05-31","claims":[{"localId":"retrieval-vs-attention-complexity","kind":"proposition","title":"Retrieval vs Attention Complexity","verification":"informal_only","review":"needs_review"}]},{"topic":"meta-analysis","url":"https://theorempath.com/topics/meta-analysis","title":"Meta-Analysis","reviewedOn":"2026-04-18","claims":[{"localId":"dersimonian-laird","kind":"theorem","title":"DerSimonian-Laird Random-Effects Estimator","verification":"informal_only","review":"needs_review"},{"localId":"fixed-effect-estimator","kind":"theorem","title":"Fixed-Effect Meta-Analytic Estimator","verification":"informal_only","review":"needs_review"}]},{"topic":"meta-learning","url":"https://theorempath.com/topics/meta-learning","title":"Meta-Learning","reviewedOn":"2026-04-14","claims":[{"localId":"maml-gradient-formula","kind":"theorem","title":"MAML Meta-Gradient","verification":"informal_only","review":"draft"},{"localId":"prototypical-network-equivalence","kind":"proposition","title":"Prototypical Networks as Linear Classifiers","verification":"informal_only","review":"draft"}]},{"topic":"method-of-moments","url":"https://theorempath.com/topics/method-of-moments","title":"Method of Moments","reviewedOn":"2026-04-26","claims":[{"localId":"mom-consistency","kind":"theorem","title":"Consistency of Method of Moments","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"metric-spaces-convergence-completeness","url":"https://theorempath.com/topics/metric-spaces-convergence-completeness","title":"Metric Spaces, Convergence, and Completeness","reviewedOn":"2026-04-26","claims":[{"localId":"banach-fixed-point-theorem","kind":"theorem","title":"Banach Fixed-Point Theorem (Contraction Mapping Theorem)","verification":"informal_only","review":"needs_review"}]},{"topic":"metropolis-hastings","url":"https://theorempath.com/topics/metropolis-hastings","title":"Metropolis-Hastings Algorithm","reviewedOn":"2026-04-25","claims":[{"localId":"mh-detailed-balance","kind":"theorem","title":"MH Satisfies Detailed Balance","verification":"informal_only","review":"needs_review"},{"localId":"mh-ergodicity","kind":"theorem","title":"Ergodicity of the MH Chain","verification":"informal_only","review":"needs_review"}]},{"topic":"minimax-lower-bounds","url":"https://theorempath.com/topics/minimax-lower-bounds","title":"Minimax Lower Bounds: Le Cam, Fano, Assouad, and the Reduction to Testing","reviewedOn":"2026-04-26","claims":[{"localId":"assouad-lemma","kind":"lemma","title":"Assouad Lemma","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"fano-inequality","kind":"theorem","title":"Fano's Inequality for Minimax Risk","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"le-cam-two-point","kind":"theorem","title":"Le Cam Two-Point Method","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"yang-barron-metric-entropy","kind":"theorem","title":"Yang-Barron Bridge: Metric Entropy to Minimax Rate","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"minimax-saddle-points","url":"https://theorempath.com/topics/minimax-saddle-points","title":"Minimax and Saddle Points","reviewedOn":"2026-05-03","claims":[{"localId":"sion-minimax","kind":"theorem","title":"Sion Minimax Theorem","verification":"informal_only","review":"needs_review"},{"localId":"von-neumann-minimax","kind":"theorem","title":"Von Neumann Minimax Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"minimax-theorem","url":"https://theorempath.com/topics/minimax-theorem","title":"Von Neumann Minimax Theorem","reviewedOn":"2026-04-26","claims":[{"localId":"sion-minimax","kind":"theorem","title":"Sion Minimax Theorem (1958)","verification":"informal_only","review":"needs_review"},{"localId":"von-neumann-minimax","kind":"theorem","title":"Von Neumann Minimax Theorem (1928)","verification":"informal_only","review":"needs_review"}]},{"topic":"mirror-descent-and-frank-wolfe","url":"https://theorempath.com/topics/mirror-descent-and-frank-wolfe","title":"Mirror Descent and Frank-Wolfe","reviewedOn":"2026-04-26","claims":[{"localId":"frank-wolfe-convergence","kind":"theorem","title":"Frank-Wolfe Convergence Rate","verification":"informal_only","review":"needs_review"},{"localId":"mirror-descent-convergence","kind":"theorem","title":"Mirror Descent Convergence","verification":"informal_only","review":"needs_review"}]},{"topic":"mistral-models","url":"https://theorempath.com/topics/mistral-models","title":"Mistral Models","reviewedOn":"2026-05-31","claims":[{"localId":"mixtral-active-params","kind":"proposition","title":"Active Parameters in Top-k Sparse MoE","verification":"informal_only","review":"needs_review"}]},{"topic":"mixed-precision-training","url":"https://theorempath.com/topics/mixed-precision-training","title":"Mixed Precision Training","reviewedOn":"2026-04-26","claims":[{"localId":"loss-scaling-gradient-preservation","kind":"proposition","title":"Loss Scaling Preserves Gradient Direction","verification":"informal_only","review":"needs_review"}]},{"topic":"mixture-density-networks","url":"https://theorempath.com/topics/mixture-density-networks","title":"Mixture Density Networks","reviewedOn":"2026-04-14","claims":[{"localId":"mdn-universal-density-approximation","kind":"theorem","title":"MDN Universal Density Approximation","verification":"informal_only","review":"needs_review"}]},{"topic":"mixture-of-experts","url":"https://theorempath.com/topics/mixture-of-experts","title":"Mixture of Experts","reviewedOn":"2026-05-25","claims":[{"localId":"load-balancing-loss","kind":"proposition","title":"Auxiliary Load Balancing Loss","verification":"informal_only","review":"draft"},{"localId":"moe-routing-objective","kind":"proposition","title":"MoE Routing as Token-Expert Assignment","verification":"informal_only","review":"needs_review"}]},{"topic":"ml-project-lifecycle","url":"https://theorempath.com/topics/ml-project-lifecycle","title":"ML Project Lifecycle","reviewedOn":"2026-04-26","claims":[{"localId":"data-quality-dominance","kind":"proposition","title":"Label Noise as a Practical Bottleneck","verification":"informal_only","review":"needs_review"}]},{"topic":"modal-serverless-gpu-platform","url":"https://theorempath.com/topics/modal-serverless-gpu-platform","title":"Modal: Serverless GPU Platform","reviewedOn":"2026-04-18","claims":[{"localId":"burstiness-fit-principle","kind":"proposition","title":"Burstiness Fit Principle","verification":"informal_only","review":"needs_review"}]},{"topic":"model-based-rl","url":"https://theorempath.com/topics/model-based-rl","title":"Model-Based Reinforcement Learning","reviewedOn":"2026-04-22","claims":[{"localId":"dyna-equivalence","kind":"proposition","title":"Planning Updates with a Perfect Model are Equivalent to Real Updates","verification":"informal_only","review":"needs_review"},{"localId":"model-error-value-bound","kind":"theorem","title":"Value Function Error from Model Error","verification":"informal_only","review":"needs_review"}]},{"topic":"model-collapse-and-data-quality","url":"https://theorempath.com/topics/model-collapse-and-data-quality","title":"Model Collapse and Data Quality","reviewedOn":"2026-05-26","claims":[{"localId":"model-collapse-variance-decay","kind":"theorem","title":"Variance Decay Under Iterative Retraining","verification":"informal_only","review":"needs_review"},{"localId":"tail-disappearance-theorem","kind":"proposition","title":"Tails Vanish Under Iterative Retraining","verification":"informal_only","review":"draft"}]},{"topic":"model-comparison-table","url":"https://theorempath.com/topics/model-comparison-table","title":"Model Comparison Table","reviewedOn":"2026-09-02","claims":[{"localId":"benchmark-variance-bound","kind":"proposition","title":"Benchmark Score Variance from Evaluation Design","verification":"informal_only","review":"needs_review"}]},{"topic":"model-compression-and-pruning","url":"https://theorempath.com/topics/model-compression-and-pruning","title":"Model Compression and Pruning","reviewedOn":"2026-04-26","claims":[{"localId":"distillation-bound","kind":"proposition","title":"Distillation Generalization Bound (Heuristic)","verification":"informal_only","review":"needs_review"}]},{"topic":"model-evaluation-best-practices","url":"https://theorempath.com/topics/model-evaluation-best-practices","title":"Model Evaluation Best Practices","reviewedOn":"2026-04-14","claims":[{"localId":"cross-validation-bias-variance","kind":"proposition","title":"Bias-Variance of Cross-Validation","verification":"informal_only","review":"needs_review"},{"localId":"paired-test-for-models","kind":"proposition","title":"Paired Permutation Test for Model Comparison","verification":"informal_only","review":"needs_review"}]},{"topic":"model-merging-and-weight-averaging","url":"https://theorempath.com/topics/model-merging-and-weight-averaging","title":"Model Merging and Weight Averaging","reviewedOn":"2026-05-31","claims":[{"localId":"mode-connectivity-merging","kind":"proposition","title":"Linear Mode Connectivity for Fine-tuned Models","verification":"informal_only","review":"draft"},{"localId":"swa-convergence","kind":"proposition","title":"Stochastic Weight Averaging","verification":"informal_only","review":"needs_review"}]},{"topic":"model-theory-basics","url":"https://theorempath.com/topics/model-theory-basics","title":"Model Theory Basics","reviewedOn":"2026-04-13","claims":[{"localId":"compactness-theorem","kind":"theorem","title":"Compactness Theorem","verification":"informal_only","review":"needs_review"},{"localId":"godels-completeness-theorem","kind":"theorem","title":"Godel's Completeness Theorem","verification":"informal_only","review":"needs_review"},{"localId":"lowenheim-skolem","kind":"theorem","title":"Lowenheim-Skolem Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"modes-of-convergence-random-variables","url":"https://theorempath.com/topics/modes-of-convergence-random-variables","title":"Modes of Convergence of Random Variables","reviewedOn":"2026-04-26","claims":[{"localId":"continuous-mapping-theorem","kind":"theorem","title":"Continuous Mapping Theorem","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"convergence-hierarchy","kind":"theorem","title":"Implications Among Modes of Convergence","verification":"informal_only","review":"needs_review"},{"localId":"skorokhod-representation","kind":"theorem","title":"Skorokhod Representation","verification":"informal_only","review":"needs_review"}]},{"topic":"moment-generating-functions","url":"https://theorempath.com/topics/moment-generating-functions","title":"Moment Generating Functions","reviewedOn":"2026-04-26","claims":[{"localId":"mgf-of-sum-of-independents","kind":"proposition","title":"MGF of Independent Sum","verification":"informal_only","review":"draft"},{"localId":"mgf-uniqueness-theorem","kind":"theorem","title":"MGF Uniqueness Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"monte-carlo-methods","url":"https://theorempath.com/topics/monte-carlo-methods","title":"Monte Carlo Methods","reviewedOn":"2026-05-06","claims":[{"localId":"mc-rate-clt","kind":"theorem","title":"Asymptotic Distribution of the Monte Carlo Estimator","verification":"informal_only","review":"needs_review"},{"localId":"mc-unbiasedness","kind":"theorem","title":"Monte Carlo Estimator: Unbiasedness and Variance","verification":"informal_only","review":"needs_review"}]},{"topic":"monty-hall-problem","url":"https://theorempath.com/topics/monty-hall-problem","title":"Monty Hall Problem","reviewedOn":"2026-04-13","claims":[{"localId":"monty-hall-switching-theorem","kind":"theorem","title":"Monty Hall Switching Advantage","verification":"informal_only","review":"needs_review"}]},{"topic":"multi-agent-collaboration","url":"https://theorempath.com/topics/multi-agent-collaboration","title":"Multi-Agent Collaboration","reviewedOn":"2026-05-25","claims":[{"localId":"debate-amplification-theorem","kind":"proposition","title":"Debate as a Theoretical Amplification Argument","verification":"informal_only","review":"needs_review"}]},{"topic":"multi-armed-bandits-theory","url":"https://theorempath.com/topics/multi-armed-bandits-theory","title":"Multi-Armed Bandits Theory","reviewedOn":"2026-04-17","claims":[{"localId":"lai-robbins-lower-bound","kind":"theorem","title":"Lai-Robbins Lower Bound","verification":"informal_only","review":"needs_review"},{"localId":"ucb-regret-bound","kind":"theorem","title":"UCB1 Regret Bound","verification":"informal_only","review":"needs_review"}]},{"topic":"multi-class-and-multi-label-classification","url":"https://theorempath.com/topics/multi-class-and-multi-label-classification","title":"Multi-Class and Multi-Label Classification","reviewedOn":"2026-04-23","claims":[{"localId":"multi-label-independence-assumption","kind":"proposition","title":"Multi-Label Independence Assumption","verification":"informal_only","review":"draft"},{"localId":"softmax-cross-entropy-gradient","kind":"proposition","title":"Softmax Cross-Entropy Gradient","verification":"informal_only","review":"needs_review"}]},{"topic":"multi-token-prediction","url":"https://theorempath.com/topics/multi-token-prediction","title":"Multi-Token Prediction","reviewedOn":"2026-05-29","claims":[{"localId":"mtp-speculative-speedup","kind":"proposition","title":"Expected Speedup from k-Head Speculative Decoding","verification":"informal_only","review":"draft"}]},{"topic":"multimodal-rag","url":"https://theorempath.com/topics/multimodal-rag","title":"Multimodal RAG","reviewedOn":"2026-05-25","claims":[{"localId":"multimodal-retrieval-bottleneck","kind":"proposition","title":"The Retrieval Bottleneck in Multimodal RAG","verification":"informal_only","review":"needs_review"}]},{"topic":"multivariate-distributions-atlas","url":"https://theorempath.com/topics/multivariate-distributions-atlas","title":"Multivariate Distributions Atlas","reviewedOn":"2026-05-13","claims":[{"localId":"dirichlet-multinomial-conjugacy","kind":"theorem","title":"Dirichlet-Multinomial Conjugacy","verification":"informal_only","review":"needs_review"}]},{"topic":"multivariate-normal-distribution","url":"https://theorempath.com/topics/multivariate-normal-distribution","title":"The Multivariate Normal Distribution","reviewedOn":"2026-05-10","claims":[{"localId":"cochran-sample-mean-covariance-independence","kind":"theorem","title":"Independence of Sample Mean and Sample Covariance","verification":"informal_only","review":"needs_review"},{"localId":"mvn-density-derivation","kind":"theorem","title":"Density of an Affine Image of a Standard Normal","verification":"informal_only","review":"needs_review"},{"localId":"mvn-marginal-conditional-schur","kind":"theorem","title":"Gaussian Marginals and Conditionals","verification":"informal_only","review":"needs_review"}]},{"topic":"nadaraya-watson-kernel-regression","url":"https://theorempath.com/topics/nadaraya-watson-kernel-regression","title":"Nadaraya-Watson Kernel Regression","reviewedOn":"2026-05-13","claims":[{"localId":"nw-asymptotic-mse","kind":"theorem","title":"Asymptotic Pointwise MSE for Nadaraya-Watson","verification":"informal_only","review":"needs_review"}]},{"topic":"naive-bayes","url":"https://theorempath.com/topics/naive-bayes","title":"Naive Bayes","reviewedOn":"2026-04-13","claims":[{"localId":"naive-bayes-optimality","kind":"proposition","title":"Naive Bayes Classification Optimality","verification":"source_checked","review":"source_checked","sourceRoles":["background"]}]},{"topic":"nash-equilibrium","url":"https://theorempath.com/topics/nash-equilibrium","title":"Nash Equilibrium","reviewedOn":"2026-04-26","claims":[{"localId":"nash-existence-theorem","kind":"theorem","title":"Nash Existence Theorem (1950)","verification":"informal_only","review":"needs_review"},{"localId":"nash-ppad-completeness","kind":"theorem","title":"Nash Equilibrium is PPAD-Complete","verification":"informal_only","review":"needs_review"}]},{"topic":"natural-language-processing-foundations","url":"https://theorempath.com/topics/natural-language-processing-foundations","title":"Natural Language Processing Foundations","reviewedOn":"2026-04-14","claims":[{"localId":"language-model-cross-entropy","kind":"proposition","title":"Cross-Entropy Loss and Perplexity","verification":"informal_only","review":"needs_review"}]},{"topic":"neural-architecture-search","url":"https://theorempath.com/topics/neural-architecture-search","title":"Neural Architecture Search","reviewedOn":"2026-04-26","claims":[{"localId":"darts-relaxation","kind":"proposition","title":"DARTS Continuous Relaxation","verification":"informal_only","review":"needs_review"}]},{"topic":"neural-network-optimization-landscape","url":"https://theorempath.com/topics/neural-network-optimization-landscape","title":"Neural Network Optimization Landscape","reviewedOn":"2026-04-14","claims":[{"localId":"baldi-hornik-saddle","kind":"theorem","title":"Saddle Point Dominance in Linear Networks","verification":"informal_only","review":"needs_review"},{"localId":"sam-sharpness-bound","kind":"proposition","title":"SAM Optimization Objective","verification":"informal_only","review":"needs_review"}]},{"topic":"neural-odes","url":"https://theorempath.com/topics/neural-odes","title":"Neural ODEs and Continuous-Depth Networks","reviewedOn":"2026-05-27","claims":[{"localId":"adjoint-method","kind":"theorem","title":"Adjoint Sensitivity Method","verification":"informal_only","review":"needs_review"},{"localId":"resnet-ode-limit","kind":"proposition","title":"ResNet as Discretized ODE","verification":"informal_only","review":"needs_review"}]},{"topic":"neural-sdes","url":"https://theorempath.com/topics/neural-sdes","title":"Neural SDEs and the Diffusion Bridge","reviewedOn":"2026-05-27","claims":[{"localId":"neural-sde-existence","kind":"theorem","title":"Existence and Uniqueness for Neural SDEs","verification":"informal_only","review":"needs_review"},{"localId":"probability-flow-ode-equivalence","kind":"theorem","title":"Probability Flow ODE (Song et al. 2021)","verification":"informal_only","review":"needs_review"}]},{"topic":"neural-tangent-kernel","url":"https://theorempath.com/topics/neural-tangent-kernel","title":"Neural Tangent Kernel: Lazy Training, Kernel Equivalence, μP, and the Limits of Width","reviewedOn":"2026-07-03","claims":[{"localId":"mup-zero-shot-transfer","kind":"theorem","title":"μP Zero-Shot Hyperparameter Transfer (Yang et al.)","verification":"informal_only","review":"needs_review"},{"localId":"ntk-constant-during-training","kind":"theorem","title":"NTK Stays Constant During Training","verification":"informal_only","review":"needs_review"},{"localId":"ntk-convergence","kind":"theorem","title":"NTK Convergence at Infinite Width","verification":"informal_only","review":"needs_review"},{"localId":"ntk-eigenvalue-decay","kind":"theorem","title":"Generalization Rate from NTK Eigenvalue Decay (Bordelon-Pehlevan)","verification":"informal_only","review":"needs_review"},{"localId":"ntk-ridge-equivalence","kind":"theorem","title":"NTK as Kernel Ridge Regression","verification":"informal_only","review":"needs_review"}]},{"topic":"newtons-method","url":"https://theorempath.com/topics/newtons-method","title":"Newton's Method","reviewedOn":"2026-04-26","claims":[{"localId":"newton-quadratic-convergence","kind":"theorem","title":"Quadratic Convergence of Newton's Method","verification":"informal_only","review":"needs_review"}]},{"topic":"neyman-pearson-and-hypothesis-testing-theory","url":"https://theorempath.com/topics/neyman-pearson-and-hypothesis-testing-theory","title":"Neyman-Pearson and Hypothesis Testing Theory","reviewedOn":"2026-04-26","claims":[{"localId":"neyman-pearson-lemma","kind":"lemma","title":"Neyman-Pearson Lemma","verification":"source_checked","review":"source_checked","sourceRoles":["historical","proof"]},{"localId":"ump-monotone-likelihood-ratio","kind":"theorem","title":"UMP Tests via Monotone Likelihood Ratio","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"wilks-theorem","kind":"theorem","title":"Wilks' Theorem","verification":"source_checked","review":"source_checked","sourceRoles":["historical","proof"]}]},{"topic":"nmf-nonnegative-matrix-factorization","url":"https://theorempath.com/topics/nmf-nonnegative-matrix-factorization","title":"NMF (Nonnegative Matrix Factorization)","reviewedOn":"2026-04-26","claims":[{"localId":"nmf-multiplicative-update-convergence","kind":"theorem","title":"Monotonic Convergence of Multiplicative Updates","verification":"informal_only","review":"needs_review"}]},{"topic":"no-free-lunch-theorem","url":"https://theorempath.com/topics/no-free-lunch-theorem","title":"No-Free-Lunch Theorem","reviewedOn":"2026-05-08","claims":[{"localId":"all-functions-not-pac-learnable","kind":"corollary","title":"The class of all binary functions on an infinite domain is not PAC-learnable (SSBD Corollary 5.2)","verification":"informal_only","review":"needs_review"},{"localId":"no-free-lunch-theorem","kind":"theorem","title":"No-Free-Lunch (Shalev-Shwartz and Ben-David, Theorem 5.1)","verification":"informal_only","review":"needs_review"}]},{"topic":"no-regret-learning","url":"https://theorempath.com/topics/no-regret-learning","title":"No-Regret Learning","reviewedOn":"2026-04-13","claims":[{"localId":"ftrl-regret-bound","kind":"theorem","title":"FTRL Regret Bound","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"mw-regret-bound","kind":"theorem","title":"Multiplicative Weights Regret Bound","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"no-regret-to-nash","kind":"theorem","title":"No-Regret Dynamics Converge to Nash Equilibria","verification":"informal_only","review":"needs_review"}]},{"topic":"no-u-turn-sampler-and-neals-funnel","url":"https://theorempath.com/topics/no-u-turn-sampler-and-neals-funnel","title":"No-U-Turn Sampler and Neal's Funnel","reviewedOn":"2026-04-25","claims":[{"localId":"noncentered-funnel-reparameterization","kind":"proposition","title":"Non-centered coordinates undo the funnel neck","verification":"informal_only","review":"needs_review"},{"localId":"nuts-stopping-rule","kind":"proposition","title":"The NUTS stopping rule adapts path length, not target geometry","verification":"informal_only","review":"draft"}]},{"topic":"non-probability-sampling","url":"https://theorempath.com/topics/non-probability-sampling","title":"Non-Probability Sampling","reviewedOn":"2026-04-28","claims":[{"localId":"data-defect-identity","kind":"theorem","title":"Data-Defect Identity (Meng 2018)","verification":"informal_only","review":"needs_review"}]},{"topic":"nonlinear-dynamics-and-chaos-fundamentals","url":"https://theorempath.com/topics/nonlinear-dynamics-and-chaos-fundamentals","title":"Nonlinear Dynamics and Chaos Fundamentals","reviewedOn":"2026-04-23","claims":[{"localId":"lyapunov-time-horizon","kind":"proposition","title":"Lyapunov Exponents Set a Prediction Horizon","verification":"informal_only","review":"needs_review"}]},{"topic":"nonlinear-gauss-seidel","url":"https://theorempath.com/topics/nonlinear-gauss-seidel","title":"Nonlinear Gauss-Seidel","reviewedOn":"2026-04-26","claims":[{"localId":"nonlinear-gauss-seidel-contraction","kind":"theorem","title":"Contraction Gives Linear Convergence","verification":"informal_only","review":"needs_review"},{"localId":"nonlinear-gauss-seidel-descent","kind":"proposition","title":"Exact Block Minimization Gives Monotone Descent","verification":"informal_only","review":"needs_review"}]},{"topic":"nonresponse-and-missing-data","url":"https://theorempath.com/topics/nonresponse-and-missing-data","title":"Nonresponse and Missing Data","reviewedOn":"2026-04-18","claims":[{"localId":"rubins-combining-rules","kind":"theorem","title":"Rubin's Combining Rules for Multiple Imputation","verification":"informal_only","review":"needs_review"}]},{"topic":"normal-distribution","url":"https://theorempath.com/topics/normal-distribution","title":"Normal Distribution","reviewedOn":"2026-08-01","claims":[{"localId":"normal-closure-under-affine-and-sum","kind":"theorem","title":"Affine and Sum Closure","verification":"informal_only","review":"draft"},{"localId":"normal-density-integrates-to-one","kind":"proposition","title":"Normal Density Integrates to One","verification":"informal_only","review":"needs_review"},{"localId":"normal-mgf","kind":"theorem","title":"Normal Moment Generating Function","verification":"informal_only","review":"needs_review"},{"localId":"normal-mle","kind":"theorem","title":"MLE for Mean and Variance","verification":"informal_only","review":"needs_review"},{"localId":"sample-mean-and-variance-independence-normal","kind":"theorem","title":"Independence of Sample Mean and Sample Variance","verification":"informal_only","review":"needs_review"}]},{"topic":"normalization-flows","url":"https://theorempath.com/topics/normalization-flows","title":"Normalizing Flows","reviewedOn":"2026-04-26","claims":[{"localId":"coupling-layer-tractability","kind":"proposition","title":"Coupling Layer Jacobian is Triangular","verification":"informal_only","review":"needs_review"},{"localId":"flow-change-of-variables","kind":"theorem","title":"Change of Variables for Normalizing Flows","verification":"informal_only","review":"needs_review"}]},{"topic":"number-theory-and-ml","url":"https://theorempath.com/topics/number-theory-and-ml","title":"Number Theory and Machine Learning","reviewedOn":"2026-05-26","claims":[{"localId":"quasi-random-discrepancy-bound","kind":"theorem","title":"Koksma-Hlawka Inequality","verification":"informal_only","review":"needs_review"}]},{"topic":"numerical-linear-algebra","url":"https://theorempath.com/topics/numerical-linear-algebra","title":"Numerical Linear Algebra","reviewedOn":"2026-04-26","claims":[{"localId":"cholesky-existence","kind":"theorem","title":"Existence and Uniqueness of Cholesky Factorization","verification":"informal_only","review":"needs_review"},{"localId":"condition-number-error-bound","kind":"theorem","title":"Condition Number and Perturbation Bound","verification":"informal_only","review":"needs_review"}]},{"topic":"numerical-stability","url":"https://theorempath.com/topics/numerical-stability","title":"Numerical Stability and Conditioning","reviewedOn":"2026-04-26","claims":[{"localId":"backward-stability-theorem","kind":"theorem","title":"Backward Stability of Gaussian Elimination with Partial Pivoting","verification":"informal_only","review":"needs_review"},{"localId":"catastrophic-cancellation-bound","kind":"proposition","title":"Catastrophic Cancellation","verification":"informal_only","review":"needs_review"}]},{"topic":"nvidia-gpu-architectures","url":"https://theorempath.com/topics/nvidia-gpu-architectures","title":"NVIDIA GPU Architectures","reviewedOn":"2026-04-18","claims":[{"localId":"memory-bandwidth-bottleneck","kind":"proposition","title":"Memory Bandwidth Bottleneck for Inference","verification":"informal_only","review":"draft"}]},{"topic":"object-detection-and-segmentation","url":"https://theorempath.com/topics/object-detection-and-segmentation","title":"Object Detection and Segmentation","reviewedOn":"2026-04-14","claims":[{"localId":"iou-metric-properties","kind":"proposition","title":"IoU as a Metric","verification":"informal_only","review":"needs_review"}]},{"topic":"occupancy-networks-and-neural-fields","url":"https://theorempath.com/topics/occupancy-networks-and-neural-fields","title":"Occupancy Networks and Neural Fields","reviewedOn":"2026-05-26","claims":[{"localId":"volume-rendering-equation","kind":"proposition","title":"Volume Rendering for Neural Radiance Fields","verification":"informal_only","review":"draft"}]},{"topic":"official-statistics-and-national-surveys","url":"https://theorempath.com/topics/official-statistics-and-national-surveys","title":"Official Statistics and National Surveys","reviewedOn":"2026-04-26","claims":[{"localId":"total-survey-error-decomposition","kind":"proposition","title":"Total Survey Error as a Conceptual Decomposition","verification":"informal_only","review":"draft"}]},{"topic":"offline-reinforcement-learning","url":"https://theorempath.com/topics/offline-reinforcement-learning","title":"Offline Reinforcement Learning","reviewedOn":"2026-04-26","claims":[{"localId":"cql-lower-bound","kind":"theorem","title":"CQL Lower Bound on Q-Values","verification":"informal_only","review":"needs_review"},{"localId":"offline-rl-extrapolation-error","kind":"proposition","title":"Extrapolation Error in Offline Q-Learning","verification":"informal_only","review":"needs_review"}]},{"topic":"online-convex-optimization","url":"https://theorempath.com/topics/online-convex-optimization","title":"Online Convex Optimization","reviewedOn":"2026-04-14","claims":[{"localId":"adagrad-regret-bound","kind":"theorem","title":"AdaGrad Diagonal Regret Bound","verification":"informal_only","review":"needs_review"},{"localId":"ftrl-regret-bound-oco","kind":"theorem","title":"FTRL Regret Bound","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"ogd-regret-bound","kind":"theorem","title":"Online Gradient Descent Regret Bound","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"online-learning-and-bandits","url":"https://theorempath.com/topics/online-learning-and-bandits","title":"Online Learning and Bandits","reviewedOn":"2026-04-14","claims":[{"localId":"explore-exploit-lower-bound","kind":"theorem","title":"Minimax Regret Lower Bound for Bandits","verification":"informal_only","review":"needs_review"},{"localId":"thompson-sampling-bayesian-regret","kind":"theorem","title":"Thompson Sampling Bayesian Regret","verification":"informal_only","review":"needs_review"},{"localId":"ucb-regret-bound","kind":"theorem","title":"UCB1 Regret Bound","verification":"informal_only","review":"needs_review"}]},{"topic":"open-problems-in-matrix-computation","url":"https://theorempath.com/topics/open-problems-in-matrix-computation","title":"Open Problems in Matrix Computation","reviewedOn":"2026-04-26","claims":[{"localId":"randomized-svd-guarantee","kind":"theorem","title":"Randomized SVD Approximation","verification":"informal_only","review":"needs_review"},{"localId":"sparse-matmul-barrier","kind":"proposition","title":"The Practicality Barrier","verification":"informal_only","review":"needs_review"}]},{"topic":"open-problems-in-ml-theory","url":"https://theorempath.com/topics/open-problems-in-ml-theory","title":"Open Problems in ML Theory","reviewedOn":"2026-05-31","claims":[{"localId":"zhang-rethinking-generalization","kind":"proposition","title":"Rethinking Generalization (Zhang et al. 2017)","verification":"informal_only","review":"needs_review"}]},{"topic":"optimal-brain-surgery-and-pruning-theory","url":"https://theorempath.com/topics/optimal-brain-surgery-and-pruning-theory","title":"Optimal Brain Surgeon and Pruning Theory","reviewedOn":"2026-04-27","claims":[{"localId":"obd-saliency-criterion","kind":"proposition","title":"Hierarchy of Saliency Approximations","verification":"informal_only","review":"draft"},{"localId":"obs-weight-update","kind":"theorem","title":"OBS Optimal Weight Update","verification":"informal_only","review":"needs_review"}]},{"topic":"optimal-transport-and-earth-movers-distance","url":"https://theorempath.com/topics/optimal-transport-and-earth-movers-distance","title":"Optimal Transport and Earth Mover's Distance","reviewedOn":"2026-04-14","claims":[{"localId":"kantorovich-duality","kind":"theorem","title":"Kantorovich Duality","verification":"informal_only","review":"needs_review"},{"localId":"sinkhorn-convergence","kind":"theorem","title":"Sinkhorn Convergence","verification":"informal_only","review":"needs_review"}]},{"topic":"optimizer-theory-sgd-adam-muon","url":"https://theorempath.com/topics/optimizer-theory-sgd-adam-muon","title":"Optimizer Theory: SGD, Adam, and Muon","reviewedOn":"2026-04-26","claims":[{"localId":"nesterov-acceleration","kind":"theorem","title":"Nesterov Accelerated Gradient Descent","verification":"informal_only","review":"needs_review"},{"localId":"sgd-convex-convergence","kind":"theorem","title":"SGD Convergence for Convex Functions","verification":"informal_only","review":"needs_review"},{"localId":"sgd-strongly-convex-convergence","kind":"theorem","title":"SGD Convergence for Strongly Convex Functions","verification":"informal_only","review":"needs_review"}]},{"topic":"options-and-temporal-abstraction","url":"https://theorempath.com/topics/options-and-temporal-abstraction","title":"Options and Temporal Abstraction","reviewedOn":"2026-04-18","claims":[{"localId":"options-bellman-equation","kind":"theorem","title":"Bellman Equation for Options","verification":"informal_only","review":"draft"}]},{"topic":"order-statistics","url":"https://theorempath.com/topics/order-statistics","title":"Order Statistics","reviewedOn":"2026-04-26","claims":[{"localId":"max-subgaussian-bound","kind":"proposition","title":"Maximum of Subgaussian Random Variables","verification":"informal_only","review":"needs_review"},{"localId":"order-statistic-density","kind":"theorem","title":"Density of the k-th Order Statistic","verification":"informal_only","review":"needs_review"}]},{"topic":"out-of-distribution-detection","url":"https://theorempath.com/topics/out-of-distribution-detection","title":"Out-of-Distribution Detection","reviewedOn":"2026-04-17","claims":[{"localId":"energy-score-separation","kind":"proposition","title":"Energy Score Separates In- and Out-Distribution","verification":"informal_only","review":"draft"},{"localId":"softmax-overconfidence","kind":"proposition","title":"Softmax Overconfidence on OOD Inputs","verification":"informal_only","review":"needs_review"}]},{"topic":"overfitting-and-underfitting","url":"https://theorempath.com/topics/overfitting-and-underfitting","title":"Overfitting and Underfitting","reviewedOn":"2026-04-22","claims":[{"localId":"overfitting-diagnostic-inequality","kind":"theorem","title":"Generalization Gap Decomposition","verification":"informal_only","review":"needs_review"}]},{"topic":"p-hacking-and-multiple-testing","url":"https://theorempath.com/topics/p-hacking-and-multiple-testing","title":"P-Hacking and Multiple Testing","reviewedOn":"2026-04-26","claims":[{"localId":"benjamini-hochberg-fdr","kind":"theorem","title":"Benjamini-Hochberg Procedure","verification":"informal_only","review":"needs_review"},{"localId":"bonferroni-correction","kind":"proposition","title":"Bonferroni Correction","verification":"informal_only","review":"needs_review"}]},{"topic":"p-values","url":"https://theorempath.com/topics/p-values","title":"p-values","reviewedOn":"2026-05-13","claims":[{"localId":"p-value-uniform-under-null","kind":"theorem","title":"p-value is Uniform Under the Null","verification":"informal_only","review":"needs_review"}]},{"topic":"pac-bayes-bounds","url":"https://theorempath.com/topics/pac-bayes-bounds","title":"PAC-Bayes Bounds","reviewedOn":"2026-05-04","claims":[{"localId":"catoni-pac-bayes-bound","kind":"theorem","title":"Catoni PAC-Bayes Bound","verification":"source_checked","review":"source_checked","sourceRoles":["background"]},{"localId":"donsker-varadhan-finite-change-of-measure","kind":"lemma","title":"Donsker-Varadhan Finite Change-of-Measure Inequality (Lean-verified)","verification":"lean_verified","review":"draft"},{"localId":"finite-catoni-bounded-loss-pac-bayes-bound","kind":"theorem","title":"Finite Bounded-Loss Catoni-Style PAC-Bayes Bound (Lean-verified)","verification":"lean_verified","review":"needs_review"},{"localId":"finite-grid-mcallester-optimized-pac-bayes-bound","kind":"theorem","title":"Finite-Grid Optimized McAllester-Style PAC-Bayes Bound (Lean-verified)","verification":"lean_verified","review":"needs_review"},{"localId":"finite-mcallester-fixed-budget-pac-bayes-bound","kind":"theorem","title":"Finite Fixed-Budget McAllester-Style PAC-Bayes Bound (Lean-verified)","verification":"lean_verified","review":"draft"},{"localId":"finite-pmf-kl-nonnegativity","kind":"lemma","title":"Finite-PMF KL Nonnegativity (Lean-verified)","verification":"lean_verified","review":"needs_review"},{"localId":"mcallester-pac-bayes-bound","kind":"theorem","title":"McAllester PAC-Bayes Bound","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"posterior-gap-finite-change-of-measure","kind":"lemma","title":"Finite Posterior-Gap Change-of-Measure Adapter (Lean-verified)","verification":"lean_verified","review":"draft"},{"localId":"posterior-risk-finite-lambda-rearrangement","kind":"lemma","title":"Finite Posterior-Risk Lambda Rearrangement (Lean-verified)","verification":"lean_verified","review":"needs_review"},{"localId":"prior-exp-moment-finite-markov-confidence-adapter","kind":"lemma","title":"Finite Prior-Moment Markov Confidence Adapter (Lean-verified)","verification":"lean_verified","review":"needs_review"}]},{"topic":"pac-learning-framework","url":"https://theorempath.com/topics/pac-learning-framework","title":"PAC Learning Framework","reviewedOn":"2026-05-04","claims":[{"localId":"finite-class-pac-bound","kind":"theorem","title":"PAC Bound for Finite Hypothesis Classes","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"fundamental-theorem-pac","kind":"theorem","title":"Fundamental Theorem of PAC Learning","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"pac-lower-bound","kind":"theorem","title":"Sample-Complexity Lower Bound for VC Classes","verification":"informal_only","review":"needs_review"}]},{"topic":"paddleocr-and-practical-ocr","url":"https://theorempath.com/topics/paddleocr-and-practical-ocr","title":"PaddleOCR and Practical OCR","reviewedOn":"2026-04-26","claims":[{"localId":"ctc-decoding-objective","kind":"proposition","title":"CTC Loss for Sequence Recognition","verification":"informal_only","review":"needs_review"}]},{"topic":"pagerank-algorithm","url":"https://theorempath.com/topics/pagerank-algorithm","title":"PageRank Algorithm","reviewedOn":"2026-04-13","claims":[{"localId":"pagerank-existence-uniqueness","kind":"theorem","title":"Existence and Uniqueness of PageRank","verification":"informal_only","review":"needs_review"},{"localId":"power-iteration-convergence","kind":"theorem","title":"Power Iteration Convergence for PageRank","verification":"informal_only","review":"needs_review"}]},{"topic":"parallel-processing-fundamentals","url":"https://theorempath.com/topics/parallel-processing-fundamentals","title":"Parallel Processing Fundamentals","reviewedOn":"2026-04-14","claims":[{"localId":"allreduce-communication-cost","kind":"proposition","title":"Ring AllReduce Communication Cost","verification":"informal_only","review":"needs_review"},{"localId":"pipeline-bubble-fraction","kind":"proposition","title":"Pipeline Bubble Fraction","verification":"informal_only","review":"draft"}]},{"topic":"pareto-distribution","url":"https://theorempath.com/topics/pareto-distribution","title":"Pareto Distribution","reviewedOn":"2026-05-12","claims":[{"localId":"pareto-clt-regimes","kind":"theorem","title":"LLN and CLT Regimes for Iid Pareto Samples","verification":"informal_only","review":"needs_review"},{"localId":"pareto-survival-and-moments","kind":"theorem","title":"Pareto Survival, Mean, and Variance","verification":"informal_only","review":"needs_review"}]},{"topic":"particle-filters","url":"https://theorempath.com/topics/particle-filters","title":"Particle Filters","reviewedOn":"2026-04-26","claims":[{"localId":"particle-filter-consistency","kind":"theorem","title":"Particle Filter Consistency","verification":"informal_only","review":"needs_review"},{"localId":"weight-degeneracy","kind":"proposition","title":"Weight Degeneracy Without Resampling","verification":"informal_only","review":"draft"}]},{"topic":"pde-fundamentals-for-ml","url":"https://theorempath.com/topics/pde-fundamentals-for-ml","title":"PDE Fundamentals for Machine Learning","reviewedOn":"2026-04-18","claims":[{"localId":"fokker-planck-equation","kind":"theorem","title":"Fokker-Planck Equation for an SDE","verification":"informal_only","review":"needs_review"},{"localId":"pde-classification-second-order","kind":"theorem","title":"Classification of Second-Order Linear PDEs","verification":"informal_only","review":"needs_review"},{"localId":"reverse-time-sde","kind":"theorem","title":"Anderson Reverse-Time SDE","verification":"informal_only","review":"needs_review"}]},{"topic":"peano-axioms","url":"https://theorempath.com/topics/peano-axioms","title":"Peano Axioms","reviewedOn":"2026-04-13","claims":[{"localId":"peano-induction-axiom","kind":"theorem","title":"Principle of Mathematical Induction","verification":"informal_only","review":"needs_review"}]},{"topic":"perceptron","url":"https://theorempath.com/topics/perceptron","title":"Perceptron","reviewedOn":"2026-04-26","claims":[{"localId":"perceptron-convergence-theorem","kind":"theorem","title":"Perceptron Convergence Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"perfect-sampling","url":"https://theorempath.com/topics/perfect-sampling","title":"Perfect Sampling","reviewedOn":"2026-04-25","claims":[{"localId":"cftp-correctness","kind":"theorem","title":"CFTP Produces Exact Samples","verification":"informal_only","review":"needs_review"},{"localId":"monotone-cftp","kind":"proposition","title":"Monotone CFTP","verification":"informal_only","review":"needs_review"}]},{"topic":"permutation-tests","url":"https://theorempath.com/topics/permutation-tests","title":"Permutation Tests","reviewedOn":"2026-05-11","claims":[{"localId":"monte-carlo-permutation-validity","kind":"theorem","title":"Monte Carlo Permutation Validity","verification":"informal_only","review":"needs_review"},{"localId":"permutation-test-exactness","kind":"theorem","title":"Permutation Test Exactness","verification":"informal_only","review":"needs_review"}]},{"topic":"perplexity-and-language-model-evaluation","url":"https://theorempath.com/topics/perplexity-and-language-model-evaluation","title":"Perplexity and Language Model Evaluation","reviewedOn":"2026-04-14","claims":[{"localId":"perplexity-cross-entropy-equivalence","kind":"proposition","title":"Perplexity as Effective Vocabulary Size","verification":"informal_only","review":"needs_review"},{"localId":"perplexity-uniform-bound","kind":"proposition","title":"Uniform Model Perplexity","verification":"informal_only","review":"needs_review"}]},{"topic":"physics-informed-neural-networks","url":"https://theorempath.com/topics/physics-informed-neural-networks","title":"Physics-Informed Neural Networks","reviewedOn":"2026-04-26","claims":[{"localId":"pinn-loss-decomposition","kind":"proposition","title":"PINN Loss Decomposition","verification":"informal_only","review":"needs_review"}]},{"topic":"plan-then-generate","url":"https://theorempath.com/topics/plan-then-generate","title":"Plan-then-Generate","reviewedOn":"2026-05-29","claims":[{"localId":"cot-expressivity-merrill-sabharwal","kind":"theorem","title":"Chain of Thought Expands Transformer Expressivity","verification":"informal_only","review":"draft"}]},{"topic":"poisson-distribution","url":"https://theorempath.com/topics/poisson-distribution","title":"Poisson Distribution","reviewedOn":"2026-05-11","claims":[{"localId":"binomial-to-poisson-limit","kind":"theorem","title":"Rare-Event Limit (Poisson Limit Theorem)","verification":"informal_only","review":"needs_review"},{"localId":"poisson-additivity","kind":"theorem","title":"Additivity, Thinning, and Superposition","verification":"informal_only","review":"needs_review"},{"localId":"poisson-mgf","kind":"theorem","title":"Poisson MGF","verification":"informal_only","review":"needs_review"},{"localId":"poisson-mle","kind":"theorem","title":"MLE for the Poisson Rate","verification":"informal_only","review":"needs_review"}]},{"topic":"poisson-limit-theorem","url":"https://theorempath.com/topics/poisson-limit-theorem","title":"Poisson Limit Theorem and Le Cam's Bound","reviewedOn":"2026-05-12","claims":[{"localId":"le-cam-total-variation-bound","kind":"theorem","title":"Le Cam Total-Variation Bound","verification":"informal_only","review":"needs_review"},{"localId":"poisson-limit-theorem","kind":"theorem","title":"Poisson Limit Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"policy-gradient-theorem","url":"https://theorempath.com/topics/policy-gradient-theorem","title":"Policy Gradient Theorem","reviewedOn":"2026-04-23","claims":[{"localId":"baseline-invariance","kind":"proposition","title":"Baseline Does Not Change the Gradient","verification":"informal_only","review":"needs_review"},{"localId":"natural-policy-gradient","kind":"proposition","title":"Natural Policy Gradient","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"policy-gradient-theorem-main","kind":"theorem","title":"Policy Gradient Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"policy-optimization-ppo-trpo","url":"https://theorempath.com/topics/policy-optimization-ppo-trpo","title":"Policy Optimization: PPO and TRPO","reviewedOn":"2026-04-26","claims":[{"localId":"ppo-clipped-surrogate","kind":"proposition","title":"PPO Clipped Surrogate Objective","verification":"informal_only","review":"needs_review"},{"localId":"trpo-monotonic-improvement","kind":"theorem","title":"TRPO Monotonic Improvement Guarantee","verification":"informal_only","review":"needs_review"}]},{"topic":"policy-representations","url":"https://theorempath.com/topics/policy-representations","title":"Policy Representations","reviewedOn":"2026-04-14","claims":[{"localId":"log-derivative-policy-gradient","kind":"theorem","title":"Score Function Policy Gradient","verification":"informal_only","review":"draft"}]},{"topic":"positional-encoding","url":"https://theorempath.com/topics/positional-encoding","title":"Positional Encoding","reviewedOn":"2026-04-18","claims":[{"localId":"alibi-extrapolation","kind":"proposition","title":"ALiBi Provides Position via Attention Bias","verification":"informal_only","review":"needs_review"},{"localId":"rope-relative-position","kind":"theorem","title":"RoPE Encodes Relative Position in Attention Scores","verification":"informal_only","review":"needs_review"},{"localId":"sinusoidal-linear-relationship","kind":"proposition","title":"Sinusoidal Encoding Enables Linear Position Offsets","verification":"informal_only","review":"draft"}]},{"topic":"positive-semidefinite-matrices","url":"https://theorempath.com/topics/positive-semidefinite-matrices","title":"Positive Semidefinite Matrices","reviewedOn":"2026-04-26","claims":[{"localId":"psd-equivalence-theorem","kind":"theorem","title":"PSD Equivalence Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"post-training-overview","url":"https://theorempath.com/topics/post-training-overview","title":"Post-Training Overview","reviewedOn":"2026-05-29","claims":[{"localId":"sft-distribution-matching","kind":"proposition","title":"SFT as Forward-KL Minimization (Identity)","verification":"informal_only","review":"needs_review"}]},{"topic":"prasad-rao-mse-correction","url":"https://theorempath.com/topics/prasad-rao-mse-correction","title":"Prasad-Rao MSE Correction","reviewedOn":"2026-04-26","claims":[{"localId":"prasad-rao-second-order-mse","kind":"theorem","title":"Prasad-Rao Second-Order MSE Decomposition","verification":"informal_only","review":"needs_review"}]},{"topic":"preconditioned-optimizers","url":"https://theorempath.com/topics/preconditioned-optimizers","title":"Preconditioned Optimizers: Shampoo, K-FAC, and Natural Gradient","reviewedOn":"2026-05-27","claims":[{"localId":"natural-gradient-update","kind":"theorem","title":"Natural Gradient Descent","verification":"source_checked","review":"source_checked","sourceRoles":["background"]},{"localId":"shampoo-update-rule","kind":"proposition","title":"Shampoo Update Rule","verification":"informal_only","review":"needs_review"}]},{"topic":"predictive-coding-and-autoencoders-in-the-brain","url":"https://theorempath.com/topics/predictive-coding-and-autoencoders-in-the-brain","title":"Predictive Coding and Autoencoders in the Brain","reviewedOn":"2026-04-27","claims":[{"localId":"predictive-coding-local-backprop","kind":"proposition","title":"Local Backprop Approximation","verification":"informal_only","review":"draft"}]},{"topic":"prefix-caching","url":"https://theorempath.com/topics/prefix-caching","title":"Prefix Caching","reviewedOn":"2026-05-31","claims":[{"localId":"prefix-cache-latency-reduction","kind":"proposition","title":"Prefix Cache Latency Reduction","verification":"informal_only","review":"needs_review"}]},{"topic":"principal-component-analysis","url":"https://theorempath.com/topics/principal-component-analysis","title":"Principal Component Analysis","reviewedOn":"2026-05-04","claims":[{"localId":"eckart-young-theorem","kind":"theorem","title":"Eckart-Young Theorem (Best Low-Rank Approximation)","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"pca-variance-maximization","kind":"theorem","title":"PCA Maximizes Projected Variance","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"probability-flow-ode","url":"https://theorempath.com/topics/probability-flow-ode","title":"Probability Flow ODE","reviewedOn":"2026-04-26","claims":[{"localId":"instantaneous-change-of-variables","kind":"theorem","title":"Instantaneous Change of Variables (Chen et al. 2018)","verification":"informal_only","review":"needs_review"},{"localId":"probability-flow-ode-marginal-equivalence","kind":"theorem","title":"Probability Flow ODE Marginal Equivalence","verification":"informal_only","review":"needs_review"}]},{"topic":"projected-gradient-descent","url":"https://theorempath.com/topics/projected-gradient-descent","title":"Projected Gradient Descent","reviewedOn":"2026-04-14","claims":[{"localId":"pgd-convex-convergence","kind":"theorem","title":"PGD Convergence for Convex Functions","verification":"informal_only","review":"needs_review"},{"localId":"pgd-strongly-convex-convergence","kind":"theorem","title":"PGD Linear Convergence for Strongly Convex Functions","verification":"informal_only","review":"needs_review"}]},{"topic":"prompt-engineering-and-in-context-learning","url":"https://theorempath.com/topics/prompt-engineering-and-in-context-learning","title":"Prompt Engineering and In-Context Learning","reviewedOn":"2026-04-18","claims":[{"localId":"icl-as-implicit-gradient-descent","kind":"theorem","title":"ICL as Implicit Gradient Descent","verification":"informal_only","review":"draft"}]},{"topic":"proof-theory-and-cut-elimination","url":"https://theorempath.com/topics/proof-theory-and-cut-elimination","title":"Proof Theory and Cut-Elimination","reviewedOn":"2026-04-13","claims":[{"localId":"cut-elimination-theorem","kind":"theorem","title":"Cut-Elimination Theorem (Gentzen's Hauptsatz)","verification":"informal_only","review":"needs_review"}]},{"topic":"proper-scoring-rules","url":"https://theorempath.com/topics/proper-scoring-rules","title":"Proper Scoring Rules","reviewedOn":"2026-07-26","claims":[{"localId":"brier-score-decomposition","kind":"proposition","title":"Brier Score Decomposition","verification":"informal_only","review":"needs_review"},{"localId":"proper-scoring-characterization","kind":"theorem","title":"Log Score and Brier Score Are Strictly Proper","verification":"informal_only","review":"needs_review"}]},{"topic":"prospect-theory","url":"https://theorempath.com/topics/prospect-theory","title":"Prospect Theory","reviewedOn":"2026-04-15","claims":[{"localId":"prospect-theory-value-function","kind":"proposition","title":"Prospect Theory Value Function Properties","verification":"informal_only","review":"needs_review"}]},{"topic":"proximal-gradient-methods","url":"https://theorempath.com/topics/proximal-gradient-methods","title":"Proximal Gradient Methods","reviewedOn":"2026-04-13","claims":[{"localId":"fista-convergence-rate","kind":"theorem","title":"FISTA Accelerated Convergence Rate","verification":"informal_only","review":"needs_review"},{"localId":"ista-convergence-rate","kind":"theorem","title":"ISTA Convergence Rate","verification":"informal_only","review":"needs_review"}]},{"topic":"public-key-cryptography","url":"https://theorempath.com/topics/public-key-cryptography","title":"Public-Key Cryptography","reviewedOn":"2026-04-15","claims":[{"localId":"eulers-theorem","kind":"theorem","title":"Euler's Theorem","verification":"informal_only","review":"needs_review"},{"localId":"rsa-correctness","kind":"theorem","title":"RSA Correctness","verification":"informal_only","review":"needs_review"}]},{"topic":"python-for-ml-research","url":"https://theorempath.com/topics/python-for-ml-research","title":"Python for ML Research","reviewedOn":"2026-04-18","claims":[{"localId":"compiled-kernel-boundary","kind":"proposition","title":"Compiled Kernel Boundary","verification":"informal_only","review":"draft"}]},{"topic":"q-learning","url":"https://theorempath.com/topics/q-learning","title":"Q-Learning","reviewedOn":"2026-04-24","claims":[{"localId":"dqn-instability","kind":"proposition","title":"The Deadly Triad","verification":"informal_only","review":"draft"},{"localId":"q-learning-convergence","kind":"theorem","title":"Q-Learning Convergence","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"quantization-theory","url":"https://theorempath.com/topics/quantization-theory","title":"Quantization Theory","reviewedOn":"2026-04-17","claims":[{"localId":"outlier-channel-theorem","kind":"proposition","title":"Outlier Channels Dominate Quantization Error","verification":"informal_only","review":"needs_review"},{"localId":"quantization-error-bound","kind":"proposition","title":"Quantization Error Bound","verification":"informal_only","review":"draft"}]},{"topic":"quasi-newton-methods","url":"https://theorempath.com/topics/quasi-newton-methods","title":"Quasi-Newton Methods","reviewedOn":"2026-04-26","claims":[{"localId":"bfgs-superlinear-convergence","kind":"theorem","title":"BFGS Superlinear Convergence","verification":"informal_only","review":"needs_review"},{"localId":"secant-condition","kind":"proposition","title":"Derivation of the Secant Condition from Taylor Expansion","verification":"informal_only","review":"needs_review"}]},{"topic":"qwen-and-chinese-models","url":"https://theorempath.com/topics/qwen-and-chinese-models","title":"Qwen and Chinese Models","reviewedOn":"2026-07-30","claims":[{"localId":"tokenizer-efficiency-bound","kind":"proposition","title":"Tokenizer Compression Ratio for Multilingual Text","verification":"informal_only","review":"needs_review"}]},{"topic":"rademacher-complexity","url":"https://theorempath.com/topics/rademacher-complexity","title":"Rademacher Complexity","reviewedOn":"2026-07-03","claims":[{"localId":"contraction-lemma","kind":"lemma","title":"Contraction Lemma (Ledoux-Talagrand)","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"finite-sample-contraction","kind":"theorem","title":"Finite-Sample Scalar Contraction (Lean-Verified)","verification":"lean_verified","review":"draft"},{"localId":"high-probability-rademacher-gengap-bound","kind":"theorem","title":"High-Probability Rademacher Generalization Gap Bound","verification":"lean_verified","review":"needs_review"},{"localId":"linear-predictor-rademacher-bound","kind":"theorem","title":"Finite-Dimensional Linear Predictor Rademacher Bound (Lean-Verified)","verification":"lean_verified","review":"draft"},{"localId":"massart-finite-class-bound","kind":"lemma","title":"Massart Finite-Class Rademacher Bound (Effective Class)","verification":"lean_verified","review":"needs_review"},{"localId":"one-lipschitz-empirical-rademacher-contraction","kind":"lemma","title":"One-Lipschitz Empirical Rademacher Contraction (Lean-verified)","verification":"lean_verified","review":"draft"},{"localId":"rademacher-generalization-bound","kind":"theorem","title":"Rademacher Complexity Generalization Bound","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"symmetrization-lemma","kind":"lemma","title":"Symmetrization Lemma","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"vc-style-rademacher-bound","kind":"theorem","title":"Effective-Growth VC-Style Rademacher Bound","verification":"lean_verified","review":"needs_review"}]},{"topic":"radon-nikodym-and-conditional-expectation","url":"https://theorempath.com/topics/radon-nikodym-and-conditional-expectation","title":"Radon-Nikodym and Conditional Expectation","reviewedOn":"2026-04-23","claims":[{"localId":"conditional-expectation-existence","kind":"theorem","title":"Existence of Conditional Expectation","verification":"informal_only","review":"needs_review"},{"localId":"radon-nikodym-theorem","kind":"theorem","title":"Radon-Nikodym Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"random-forests","url":"https://theorempath.com/topics/random-forests","title":"Random Forests","reviewedOn":"2026-04-26","claims":[{"localId":"rf-consistency","kind":"theorem","title":"Random Forest Consistency","verification":"informal_only","review":"needs_review"},{"localId":"rf-variance-decomposition","kind":"proposition","title":"Random Forest Variance Reduction","verification":"informal_only","review":"needs_review"}]},{"topic":"random-matrix-theory-overview","url":"https://theorempath.com/topics/random-matrix-theory-overview","title":"Random Matrix Theory Overview","reviewedOn":"2026-04-26","claims":[{"localId":"bbp-phase-transition","kind":"theorem","title":"BBP Phase Transition","verification":"source_checked","review":"source_checked","sourceRoles":["background"]},{"localId":"marchenko-pastur-law","kind":"theorem","title":"Marchenko-Pastur Law","verification":"informal_only","review":"needs_review"},{"localId":"wigner-semicircle-law","kind":"theorem","title":"Wigner Semicircle Law","verification":"informal_only","review":"needs_review"}]},{"topic":"random-variables","url":"https://theorempath.com/topics/random-variables","title":"Random Variables","reviewedOn":"2026-04-22","claims":[{"localId":"generated-sigma-algebra-minimality","kind":"theorem","title":"Generated Sigma-Algebra Is the Smallest Information Making X Measurable","verification":"source_checked","review":"source_checked","sourceRoles":["definition"]},{"localId":"law-of-the-unconscious-statistician","kind":"theorem","title":"Expectation Depends on the Pushforward Law","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"law-of-total-variance-l2-projection","kind":"theorem","title":"Law of Total Variance as a Right Triangle","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"random-variable-pushforward-law","kind":"theorem","title":"A Random Variable Induces a Probability Distribution","verification":"source_checked","review":"source_checked","sourceRoles":["definition"]}]},{"topic":"rao-blackwellization","url":"https://theorempath.com/topics/rao-blackwellization","title":"Rao-Blackwellization","reviewedOn":"2026-04-13","claims":[{"localId":"rao-blackwell-theorem","kind":"theorem","title":"Rao-Blackwell Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"realizability-assumption","url":"https://theorempath.com/topics/realizability-assumption","title":"Realizability Assumption","reviewedOn":"2026-05-03","claims":[{"localId":"realizable-finite-class-corollary","kind":"corollary","title":"Realizable Finite-Class Sample Complexity","verification":"informal_only","review":"needs_review"}]},{"topic":"reasoning-data-curation","url":"https://theorempath.com/topics/reasoning-data-curation","title":"Reasoning Data Curation","reviewedOn":"2026-05-31","claims":[{"localId":"rejection-sampling-quality-bound","kind":"proposition","title":"Rejection Sampling Improves Solution Quality","verification":"informal_only","review":"needs_review"},{"localId":"verification-as-reward","kind":"proposition","title":"Verification as RL Reward Signal","verification":"informal_only","review":"needs_review"}]},{"topic":"recommender-systems","url":"https://theorempath.com/topics/recommender-systems","title":"Recommender Systems","reviewedOn":"2026-04-14","claims":[{"localId":"svd-optimal-low-rank","kind":"theorem","title":"Eckart-Young-Mirsky Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"recurrent-depth","url":"https://theorempath.com/topics/recurrent-depth","title":"The Loop Inside the Model","reviewedOn":"2026-09-02","claims":[{"localId":"recurrent-depth-compute-accounting","kind":"proposition","title":"Executed Depth Decouples From Unique Parameters","verification":"informal_only","review":"needs_review"}]},{"topic":"recurrent-neural-networks","url":"https://theorempath.com/topics/recurrent-neural-networks","title":"Recurrent Neural Networks","reviewedOn":"2026-04-13","claims":[{"localId":"vanishing-gradient-eigenvalue","kind":"proposition","title":"Gradient Scaling via Eigenvalues of W_h","verification":"informal_only","review":"needs_review"}]},{"topic":"red-teaming-and-adversarial-eval","url":"https://theorempath.com/topics/red-teaming-and-adversarial-eval","title":"Red-Teaming and Adversarial Evaluation","reviewedOn":"2026-09-15","claims":[{"localId":"adversarial-suffix-existence","kind":"proposition","title":"Adversarial Suffix Attack via Gradient Optimization","verification":"informal_only","review":"draft"}]},{"topic":"regularization-in-practice","url":"https://theorempath.com/topics/regularization-in-practice","title":"Regularization in Practice","reviewedOn":"2026-04-26","claims":[{"localId":"dropout-ensemble-interpretation","kind":"proposition","title":"Dropout as Approximate Model Averaging","verification":"informal_only","review":"draft"},{"localId":"early-stopping-l2-equivalence","kind":"proposition","title":"Early Stopping and L2 Regularization Equivalence","verification":"informal_only","review":"needs_review"},{"localId":"l2-weight-shrinkage","kind":"proposition","title":"L2 Regularization Shrinks Weights","verification":"informal_only","review":"needs_review"}]},{"topic":"regularization-theory","url":"https://theorempath.com/topics/regularization-theory","title":"Regularization Theory","reviewedOn":"2026-07-03","claims":[{"localId":"lasso-sparsity","kind":"proposition","title":"Lasso Produces Sparse Solutions","verification":"informal_only","review":"needs_review"},{"localId":"ridge-closed-form","kind":"proposition","title":"Ridge Regression Closed Form","verification":"informal_only","review":"needs_review"}]},{"topic":"reinforcement-learning-environments-and-benchmarks","url":"https://theorempath.com/topics/reinforcement-learning-environments-and-benchmarks","title":"Reinforcement Learning Environments and Benchmarks","reviewedOn":"2026-04-26","claims":[{"localId":"no-free-lunch-environments","kind":"proposition","title":"Benchmark Specificity","verification":"informal_only","review":"needs_review"}]},{"topic":"reinforcement-learning-for-synthesis-planning","url":"https://theorempath.com/topics/reinforcement-learning-for-synthesis-planning","title":"Reinforcement Learning for Synthesis Planning","reviewedOn":"2026-04-18","claims":[{"localId":"retrosynthesis-sparse-reward-bottleneck","kind":"proposition","title":"Sparse Reward Search Bottleneck","verification":"informal_only","review":"draft"}]},{"topic":"reinforcement-learning-from-human-feedback-deep-dive","url":"https://theorempath.com/topics/reinforcement-learning-from-human-feedback-deep-dive","title":"Reinforcement Learning from Human Feedback","reviewedOn":"2026-07-11","claims":[{"localId":"bradley-terry-reward-model","kind":"proposition","title":"Bradley-Terry Reward Model Loss","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"dpo-implicit-reward-identity","kind":"theorem","title":"DPO implicit-reward identity (Rafailov et al. 2023)","verification":"informal_only","review":"needs_review"},{"localId":"kl-penalty-reward-hacking","kind":"proposition","title":"KL Penalty Prevents Reward Hacking","verification":"informal_only","review":"needs_review"}]},{"topic":"rejection-sampling","url":"https://theorempath.com/topics/rejection-sampling","title":"Rejection Sampling","reviewedOn":"2026-04-13","claims":[{"localId":"rejection-acceptance-rate","kind":"theorem","title":"Dimensional Scaling of Rejection Sampling","verification":"informal_only","review":"needs_review"},{"localId":"rejection-sampling-correctness","kind":"theorem","title":"Correctness of Rejection Sampling","verification":"informal_only","review":"needs_review"}]},{"topic":"relational-algebra","url":"https://theorempath.com/topics/relational-algebra","title":"Relational Algebra","reviewedOn":"2026-04-15","claims":[{"localId":"codds-theorem","kind":"theorem","title":"Codd's Theorem: Equivalence of Relational Algebra and Relational Calculus","verification":"informal_only","review":"needs_review"}]},{"topic":"reml-and-variance-component-estimation","url":"https://theorempath.com/topics/reml-and-variance-component-estimation","title":"REML and Variance Component Estimation","reviewedOn":"2026-04-26","claims":[{"localId":"reml-error-contrast-likelihood","kind":"theorem","title":"REML as Likelihood of Error Contrasts","verification":"informal_only","review":"needs_review"}]},{"topic":"representation-learning-theory","url":"https://theorempath.com/topics/representation-learning-theory","title":"Representation Learning Theory","reviewedOn":"2026-07-03","claims":[{"localId":"contrastive-loss-mutual-information","kind":"theorem","title":"InfoNCE Bounds Mutual Information","verification":"informal_only","review":"needs_review"},{"localId":"information-bottleneck-optimality","kind":"theorem","title":"Information Bottleneck Optimality","verification":"informal_only","review":"needs_review"}]},{"topic":"reproducibility-and-experimental-rigor","url":"https://theorempath.com/topics/reproducibility-and-experimental-rigor","title":"Reproducibility and Experimental Rigor","reviewedOn":"2026-04-26","claims":[{"localId":"standard-error-of-mean","kind":"proposition","title":"Standard Error of the Mean","verification":"informal_only","review":"needs_review"}]},{"topic":"reservoir-computing-and-echo-state-networks","url":"https://theorempath.com/topics/reservoir-computing-and-echo-state-networks","title":"Reservoir Computing and Echo State Networks","reviewedOn":"2026-04-14","claims":[{"localId":"echo-state-property","kind":"theorem","title":"Sufficient Condition for the Echo State Property","verification":"informal_only","review":"needs_review"},{"localId":"reservoir-universality","kind":"theorem","title":"Reservoir Universality","verification":"informal_only","review":"draft"}]},{"topic":"residual-stream-and-transformer-internals","url":"https://theorempath.com/topics/residual-stream-and-transformer-internals","title":"Residual Stream and Transformer Internals","reviewedOn":"2026-04-18","claims":[{"localId":"pre-norm-gradient-stability","kind":"proposition","title":"Pre-Norm Gradient Flow","verification":"informal_only","review":"draft"},{"localId":"residual-stream-decomposition","kind":"proposition","title":"Residual Stream Decomposition","verification":"informal_only","review":"needs_review"}]},{"topic":"restricted-isometry-property","url":"https://theorempath.com/topics/restricted-isometry-property","title":"Restricted Isometry Property","reviewedOn":"2026-04-26","claims":[{"localId":"gaussian-rip-measurement-bound","kind":"theorem","title":"Gaussian Matrices Satisfy RIP with O(s log(n/s)) Rows","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"rip-formal-definition-theorem","kind":"theorem","title":"RIP Implies Exact Sparse Recovery via L1 Minimization","verification":"source_checked","review":"source_checked","sourceRoles":["definition"]},{"localId":"rip-jl-connection","kind":"proposition","title":"RIP and Johnson-Lindenstrauss Both Follow from Concentration of Random Projections","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"reversible-jump-mcmc","url":"https://theorempath.com/topics/reversible-jump-mcmc","title":"Reversible Jump MCMC","reviewedOn":"2026-04-14","claims":[{"localId":"rjmcmc-acceptance-ratio","kind":"theorem","title":"Reversible Jump Acceptance Probability","verification":"informal_only","review":"draft"},{"localId":"rjmcmc-detailed-balance","kind":"theorem","title":"Detailed Balance Across Dimensions","verification":"informal_only","review":"needs_review"}]},{"topic":"reward-design","url":"https://theorempath.com/topics/reward-design","title":"Reward Design and Reward Misspecification","reviewedOn":"2026-04-26","claims":[{"localId":"goodhart-reward-bound","kind":"proposition","title":"Goodhart's Law for Reward Models","verification":"informal_only","review":"needs_review"},{"localId":"potential-based-shaping","kind":"theorem","title":"Potential-Based Shaping Preserves Optimal Policy","verification":"informal_only","review":"needs_review"}]},{"topic":"reward-hacking","url":"https://theorempath.com/topics/reward-hacking","title":"Reward Hacking","reviewedOn":"2026-05-27","claims":[{"localId":"goodhart-taxonomy-for-reward-models","kind":"proposition","title":"Structured Exploit Categories","verification":"informal_only","review":"draft"},{"localId":"reward-overoptimization-scaling","kind":"proposition","title":"Gao et al. (2022) Fit for RL-with-KL in a Synthetic Proxy-Reward Setup","verification":"informal_only","review":"needs_review"}]},{"topic":"reward-models-and-verifiers","url":"https://theorempath.com/topics/reward-models-and-verifiers","title":"Reward Models and Verifiers","reviewedOn":"2026-07-05","claims":[{"localId":"bradley-terry-reward-model","kind":"theorem","title":"Bradley-Terry Reward Model Training","verification":"informal_only","review":"needs_review"},{"localId":"goodhart-overoptimization","kind":"proposition","title":"Reward Model Overoptimization","verification":"informal_only","review":"needs_review"},{"localId":"prm-vs-orm-tradeoff","kind":"proposition","title":"Process vs Outcome Reward Model Tradeoff","verification":"informal_only","review":"needs_review"}]},{"topic":"reward-systems-and-reinforcement-learning-neuroscience","url":"https://theorempath.com/topics/reward-systems-and-reinforcement-learning-neuroscience","title":"Reward Systems and Reinforcement Learning Neuroscience","reviewedOn":"2026-04-27","claims":[{"localId":"dopamine-td-error-signature","kind":"proposition","title":"Dopamine TD-Error Signature","verification":"informal_only","review":"draft"}]},{"topic":"ridge-regression","url":"https://theorempath.com/topics/ridge-regression","title":"Ridge Regression","reviewedOn":"2026-04-19","claims":[{"localId":"kernel-ridge-representer","kind":"theorem","title":"Representer Theorem for Kernel Ridge Regression","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"ridge-effective-df","kind":"proposition","title":"Effective Degrees of Freedom for Ridge","verification":"informal_only","review":"needs_review"},{"localId":"ridge-mse-dominance","kind":"theorem","title":"Ridge Strictly Improves on OLS for Some Lambda","verification":"informal_only","review":"needs_review"},{"localId":"ridge-svd-shrinkage","kind":"theorem","title":"Ridge Acts as Component-wise Shrinkage in the SVD Basis","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"ridgeless-benign-overfitting","kind":"theorem","title":"Ridgeless OLS Can Generalize in High Dimension","verification":"informal_only","review":"needs_review"}]},{"topic":"ridge-resolvents","url":"https://theorempath.com/topics/ridge-resolvents","title":"Ridge Resolvents","reviewedOn":"2026-05-13","claims":[{"localId":"ridge-bias-variance-resolvent","kind":"theorem","title":"Bias-Variance Decomposition via the Resolvent","verification":"informal_only","review":"needs_review"},{"localId":"ridge-resolvent-derivative","kind":"proposition","title":"Resolvent Derivative","verification":"informal_only","review":"needs_review"}]},{"topic":"riemannian-optimization","url":"https://theorempath.com/topics/riemannian-optimization","title":"Riemannian Optimization and Manifold Constraints","reviewedOn":"2026-04-18","claims":[{"localId":"riemannian-gradient-descent","kind":"theorem","title":"Riemannian Gradient Descent","verification":"informal_only","review":"needs_review"},{"localId":"stiefel-retraction","kind":"proposition","title":"Tangent Space and Retraction on the Stiefel Manifold","verification":"informal_only","review":"needs_review"}]},{"topic":"ring-vs-tree-attention","url":"https://theorempath.com/topics/ring-vs-tree-attention","title":"Ring vs. Tree Attention","reviewedOn":"2026-07-12","claims":[{"localId":"online-softmax-merge-associativity","kind":"proposition","title":"The Online-Softmax Normalizer Merge Is a Commutative Semigroup","verification":"informal_only","review":"needs_review"}]},{"topic":"rlhf-and-alignment","url":"https://theorempath.com/topics/rlhf-and-alignment","title":"RLHF and Alignment","reviewedOn":"2026-07-03","claims":[{"localId":"bradley-terry-model","kind":"proposition","title":"Bradley-Terry Maximum Likelihood","verification":"informal_only","review":"draft"},{"localId":"dpo-equivalence","kind":"theorem","title":"DPO as Implicit Reward Model","verification":"informal_only","review":"needs_review"},{"localId":"kl-regularized-objective","kind":"proposition","title":"KL-Regularized RLHF Objective","verification":"informal_only","review":"needs_review"}]},{"topic":"robust-adversarial-policies","url":"https://theorempath.com/topics/robust-adversarial-policies","title":"Robust Adversarial Policies","reviewedOn":"2026-04-26","claims":[{"localId":"robust-bellman-equation","kind":"theorem","title":"Robust Bellman Equation","verification":"informal_only","review":"needs_review"}]},{"topic":"robust-statistics-and-m-estimators","url":"https://theorempath.com/topics/robust-statistics-and-m-estimators","title":"Robust Statistics and M-Estimators","reviewedOn":"2026-04-13","claims":[{"localId":"breakdown-point-bound","kind":"proposition","title":"Maximum Breakdown Point","verification":"informal_only","review":"draft"},{"localId":"influence-function-of-m-estimator","kind":"theorem","title":"Influence Function of an M-Estimator","verification":"informal_only","review":"needs_review"}]},{"topic":"roc-curve-and-auc","url":"https://theorempath.com/topics/roc-curve-and-auc","title":"ROC Curve and AUC","reviewedOn":"2026-05-03","claims":[{"localId":"auc-as-ranking-probability","kind":"theorem","title":"AUC equals the Wilcoxon-Mann-Whitney probability","verification":"informal_only","review":"needs_review"}]},{"topic":"safe-testing","url":"https://theorempath.com/topics/safe-testing","title":"Safe Testing","reviewedOn":"2026-08-08","claims":[{"localId":"safe-test-via-e-value","kind":"theorem","title":"E-Value Construction Yields a Safe Test","verification":"informal_only","review":"needs_review"}]},{"topic":"sample-complexity-bounds","url":"https://theorempath.com/topics/sample-complexity-bounds","title":"Sample Complexity Bounds","reviewedOn":"2026-04-26","claims":[{"localId":"fano-lower-bound","kind":"theorem","title":"Fano Method Lower Bound","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"finite-class-realizable-sample-complexity","kind":"theorem","title":"Realizable Finite-Class Sample Complexity","verification":"informal_only","review":"draft"},{"localId":"finite-class-sample-complexity","kind":"theorem","title":"Sample Complexity of Finite Hypothesis Classes","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"rademacher-sample-complexity","kind":"theorem","title":"Sample Complexity via Rademacher Complexity","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"vc-sample-complexity","kind":"theorem","title":"Agnostic Sample Complexity via VC Dimension","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"sample-size-determination","url":"https://theorempath.com/topics/sample-size-determination","title":"Sample Size Determination","reviewedOn":"2026-04-14","claims":[{"localId":"sample-size-for-mean-estimation","kind":"theorem","title":"Minimum Sample Size for Mean Estimation","verification":"informal_only","review":"needs_review"}]},{"topic":"scale-location-shape-parameters","url":"https://theorempath.com/topics/scale-location-shape-parameters","title":"Scale, Location, and Shape Parameters","reviewedOn":"2026-05-13","claims":[{"localId":"location-scale-affine-closure","kind":"proposition","title":"Affine Closure of Location-Scale Families","verification":"informal_only","review":"needs_review"}]},{"topic":"scaling-compute-optimal-training","url":"https://theorempath.com/topics/scaling-compute-optimal-training","title":"Scaling Compute-Optimal Training","reviewedOn":"2026-05-27","claims":[{"localId":"chinchilla-optimal-allocation","kind":"proposition","title":"Chinchilla Compute-Optimal Allocation","verification":"informal_only","review":"needs_review"},{"localId":"kaplan-vs-chinchilla-exponents","kind":"proposition","title":"Kaplan vs Chinchilla Exponent Discrepancy","verification":"informal_only","review":"needs_review"}]},{"topic":"scaling-laws","url":"https://theorempath.com/topics/scaling-laws","title":"Scaling Laws","reviewedOn":"2026-08-04","claims":[{"localId":"chinchilla-optimal-allocation","kind":"theorem","title":"Chinchilla-Optimal Compute Allocation","verification":"informal_only","review":"needs_review"},{"localId":"compute-optimal-allocation-lagrangian","kind":"proposition","title":"Compute-Optimal Allocation under the Decomposed Form","verification":"informal_only","review":"needs_review"},{"localId":"data-constrained-scaling","kind":"theorem","title":"Data-Constrained Scaling Law (Muennighoff)","verification":"informal_only","review":"needs_review"},{"localId":"kaplan-power-law","kind":"proposition","title":"Power-Law Scaling of Language Model Loss","verification":"informal_only","review":"needs_review"}]},{"topic":"score-matching","url":"https://theorempath.com/topics/score-matching","title":"Score Matching","reviewedOn":"2026-04-19","claims":[{"localId":"hyvarinen-implicit-score-matching","kind":"theorem","title":"Hyvärinen's Implicit Score Matching Theorem","verification":"informal_only","review":"needs_review"},{"localId":"score-matching-consistency","kind":"theorem","title":"Asymptotic Consistency of the Score Matching Estimator","verification":"informal_only","review":"needs_review"},{"localId":"sliced-score-matching","kind":"theorem","title":"Sliced Score Matching (Song-Garg-Shi-Ermon 2020)","verification":"informal_only","review":"needs_review"},{"localId":"tweedie-formula","kind":"theorem","title":"Tweedie's Formula","verification":"informal_only","review":"needs_review"},{"localId":"vincent-denoising-score-matching","kind":"theorem","title":"Vincent's Denoising Score Matching Identity","verification":"informal_only","review":"needs_review"}]},{"topic":"secant-method","url":"https://theorempath.com/topics/secant-method","title":"Secant Method","reviewedOn":"2026-04-27","claims":[{"localId":"secant-convergence-order","kind":"theorem","title":"Superlinear Convergence of the Secant Method","verification":"informal_only","review":"needs_review"}]},{"topic":"second-order-optimization-methods","url":"https://theorempath.com/topics/second-order-optimization-methods","title":"Second-Order Optimization Methods","reviewedOn":"2026-04-14","claims":[{"localId":"gauss-newton-approximation","kind":"proposition","title":"Gauss-Newton Approximation","verification":"informal_only","review":"needs_review"},{"localId":"natural-gradient-invariance","kind":"theorem","title":"Parameterization Invariance of Natural Gradient","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"newton-quadratic-convergence","kind":"theorem","title":"Quadratic Convergence of Newton's Method","verification":"informal_only","review":"needs_review"}]},{"topic":"self-organizing-maps","url":"https://theorempath.com/topics/self-organizing-maps","title":"Self-Organizing Maps","reviewedOn":"2026-04-13","claims":[{"localId":"som-topology-preservation","kind":"proposition","title":"Topology Preservation of SOMs","verification":"informal_only","review":"needs_review"}]},{"topic":"self-play-and-multi-agent-rl","url":"https://theorempath.com/topics/self-play-and-multi-agent-rl","title":"Self-Play and Multi-Agent RL","reviewedOn":"2026-04-14","claims":[{"localId":"fictitious-play-convergence","kind":"theorem","title":"Fictitious Play Convergence in Zero-Sum Games","verification":"informal_only","review":"needs_review"},{"localId":"self-play-no-regret","kind":"theorem","title":"No-Regret Self-Play Converges to Nash","verification":"informal_only","review":"needs_review"}]},{"topic":"self-supervised-vision","url":"https://theorempath.com/topics/self-supervised-vision","title":"Self-Supervised Vision","reviewedOn":"2026-04-13","claims":[{"localId":"dino-collapse-prevention","kind":"proposition","title":"DINO Collapse Prevention via Centering and Sharpening","verification":"informal_only","review":"needs_review"},{"localId":"infonce-mutual-information","kind":"proposition","title":"InfoNCE and Mutual Information","verification":"informal_only","review":"needs_review"},{"localId":"mae-reconstruction-objective","kind":"proposition","title":"Masked Autoencoder (MAE) Objective","verification":"informal_only","review":"draft"}]},{"topic":"semantic-search-and-embeddings","url":"https://theorempath.com/topics/semantic-search-and-embeddings","title":"Semantic Search and Embeddings","reviewedOn":"2026-04-26","claims":[{"localId":"jl-lemma-ann","kind":"lemma","title":"Johnson-Lindenstrauss Lemma for Embeddings","verification":"informal_only","review":"needs_review"}]},{"topic":"sequences-and-series-of-functions","url":"https://theorempath.com/topics/sequences-and-series-of-functions","title":"Sequences and Series of Functions","reviewedOn":"2026-04-26","claims":[{"localId":"uniform-convergence-preserves-continuity","kind":"theorem","title":"Uniform Limit of Continuous Functions is Continuous","verification":"informal_only","review":"needs_review"},{"localId":"weierstrass-m-test","kind":"theorem","title":"Weierstrass M-Test","verification":"informal_only","review":"needs_review"}]},{"topic":"sets-functions-and-relations","url":"https://theorempath.com/topics/sets-functions-and-relations","title":"Sets, Functions, and Relations","reviewedOn":"2026-08-01","claims":[{"localId":"cantor-theorem","kind":"theorem","title":"Cantor's Theorem","verification":"informal_only","review":"needs_review"},{"localId":"schroeder-bernstein","kind":"theorem","title":"Schroeder-Bernstein Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"sgd-as-sde","url":"https://theorempath.com/topics/sgd-as-sde","title":"SGD as a Stochastic Differential Equation","reviewedOn":"2026-04-18","claims":[{"localId":"li-tai-e-order-1-weak-approximation","kind":"theorem","title":"Li–Tai–E Order-1 Weak Approximation","verification":"informal_only","review":"needs_review"}]},{"topic":"shrinkage-estimation-james-stein","url":"https://theorempath.com/topics/shrinkage-estimation-james-stein","title":"Shrinkage Estimation and the James-Stein Estimator: Inadmissibility, SURE, and Brown's Characterization","reviewedOn":"2026-04-26","claims":[{"localId":"brown-admissibility-characterization","kind":"theorem","title":"Brown's Admissibility Characterization (informal)","verification":"informal_only","review":"needs_review"},{"localId":"james-stein-dominance","kind":"theorem","title":"James-Stein Inadmissibility of the MLE","verification":"informal_only","review":"needs_review"},{"localId":"positive-part-dominance","kind":"theorem","title":"Positive-Part James-Stein Dominates the Basic Estimator","verification":"informal_only","review":"needs_review"},{"localId":"stein-identity","kind":"lemma","title":"Stein's Identity for Gaussian Random Vectors","verification":"informal_only","review":"needs_review"},{"localId":"steins-unbiased-risk-estimate","kind":"lemma","title":"Stein's Unbiased Risk Estimate (SURE)","verification":"informal_only","review":"needs_review"}]},{"topic":"signal-detection-theory","url":"https://theorempath.com/topics/signal-detection-theory","title":"Signal Detection Theory","reviewedOn":"2026-04-15","claims":[{"localId":"auc-concordance","kind":"proposition","title":"AUC as Concordance Probability","verification":"informal_only","review":"needs_review"},{"localId":"neyman-pearson-lemma","kind":"lemma","title":"Neyman-Pearson Lemma","verification":"informal_only","review":"needs_review"}]},{"topic":"signals-and-systems-for-ml","url":"https://theorempath.com/topics/signals-and-systems-for-ml","title":"Signals and Systems for ML","reviewedOn":"2026-04-18","claims":[{"localId":"convolution-theorem","kind":"theorem","title":"Convolution Theorem","verification":"informal_only","review":"needs_review"},{"localId":"nyquist-sampling-theorem","kind":"theorem","title":"Nyquist-Shannon Sampling Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"simpsons-paradox","url":"https://theorempath.com/topics/simpsons-paradox","title":"Simpson's Paradox","reviewedOn":"2026-04-13","claims":[{"localId":"simpsons-reversal-condition","kind":"theorem","title":"Simpsons Reversal Condition","verification":"informal_only","review":"needs_review"}]},{"topic":"singular-learning-theory","url":"https://theorempath.com/topics/singular-learning-theory","title":"Singular Learning Theory","reviewedOn":"2026-06-04","claims":[{"localId":"watanabe-free-energy-expansion","kind":"theorem","title":"Watanabe Free-Energy Expansion","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"singular-value-decomposition","url":"https://theorempath.com/topics/singular-value-decomposition","title":"Singular Value Decomposition","reviewedOn":"2026-08-01","claims":[{"localId":"eckart-young-theorem","kind":"theorem","title":"Eckart-Young-Mirsky Theorem (Best Low-Rank Approximation)","verification":"informal_only","review":"needs_review"},{"localId":"svd-existence","kind":"theorem","title":"Existence and Uniqueness of the SVD","verification":"informal_only","review":"needs_review"}]},{"topic":"skewness-kurtosis-and-higher-moments","url":"https://theorempath.com/topics/skewness-kurtosis-and-higher-moments","title":"Skewness, Kurtosis, and Higher Moments","reviewedOn":"2026-04-26","claims":[{"localId":"gaussian-cumulant-characterization","kind":"theorem","title":"Gaussian Characterization via Cumulants","verification":"informal_only","review":"needs_review"}]},{"topic":"skip-connections-and-resnets","url":"https://theorempath.com/topics/skip-connections-and-resnets","title":"Skip Connections and ResNets","reviewedOn":"2026-04-14","claims":[{"localId":"residual-gradient-flow","kind":"proposition","title":"Gradient Flow Through Residual Connections","verification":"informal_only","review":"needs_review"},{"localId":"resnet-ode-connection","kind":"proposition","title":"ResNet as Euler Discretization","verification":"informal_only","review":"draft"}]},{"topic":"slice-sampling","url":"https://theorempath.com/topics/slice-sampling","title":"Slice Sampling","reviewedOn":"2026-04-14","claims":[{"localId":"slice-sampler-invariance","kind":"theorem","title":"Slice Sampler Preserves the Target Distribution","verification":"informal_only","review":"needs_review"},{"localId":"slice-sampler-uniform-ergodicity","kind":"theorem","title":"Uniform Ergodicity of the Slice Sampler","verification":"informal_only","review":"needs_review"}]},{"topic":"sluds-inequality","url":"https://theorempath.com/topics/sluds-inequality","title":"Slud's Inequality","reviewedOn":"2026-05-08","claims":[{"localId":"sluds-inequality","kind":"theorem","title":"Slud's Inequality","verification":"informal_only","review":"needs_review"}]},{"topic":"small-area-estimation","url":"https://theorempath.com/topics/small-area-estimation","title":"Small Area Estimation","reviewedOn":"2026-04-26","claims":[{"localId":"fay-herriot-composite-estimator","kind":"theorem","title":"Fay-Herriot Composite Estimator","verification":"informal_only","review":"needs_review"}]},{"topic":"smoothing-splines","url":"https://theorempath.com/topics/smoothing-splines","title":"Smoothing Splines","reviewedOn":"2026-05-13","claims":[{"localId":"smoothing-spline-natural-cubic","kind":"theorem","title":"Solution to the Penalized Least Squares","verification":"informal_only","review":"needs_review"}]},{"topic":"snowflake-data-warehouse","url":"https://theorempath.com/topics/snowflake-data-warehouse","title":"Snowflake Data Warehouse","reviewedOn":"2026-04-18","claims":[{"localId":"storage-compute-separation-principle","kind":"proposition","title":"Storage-Compute Separation Principle","verification":"informal_only","review":"draft"}]},{"topic":"softmax-and-numerical-stability","url":"https://theorempath.com/topics/softmax-and-numerical-stability","title":"Softmax and Numerical Stability","reviewedOn":"2026-04-13","claims":[{"localId":"log-sum-exp-stability","kind":"proposition","title":"Numerical Stability of the Shifted Log-Sum-Exp","verification":"informal_only","review":"needs_review"}]},{"topic":"sorting-algorithms","url":"https://theorempath.com/topics/sorting-algorithms","title":"Sorting Algorithms","reviewedOn":"2026-04-26","claims":[{"localId":"comparison-sorting-lower-bound","kind":"theorem","title":"Comparison-Based Sorting Lower Bound","verification":"informal_only","review":"needs_review"},{"localId":"quicksort-expected-time","kind":"theorem","title":"Quicksort Expected Runtime","verification":"informal_only","review":"needs_review"}]},{"topic":"sparse-attention-and-long-context","url":"https://theorempath.com/topics/sparse-attention-and-long-context","title":"Sparse Attention and Long Context","reviewedOn":"2026-05-31","claims":[{"localId":"lsh-attention-approximation","kind":"proposition","title":"LSH Attention Approximation","verification":"informal_only","review":"needs_review"},{"localId":"sparse-attention-complexity","kind":"proposition","title":"Sparse Attention Reduces Complexity","verification":"informal_only","review":"needs_review"}]},{"topic":"sparse-autoencoders","url":"https://theorempath.com/topics/sparse-autoencoders","title":"Sparse Autoencoders for Interpretability: TopK, JumpReLU, Matryoshka, and Scaling","reviewedOn":"2026-07-11","claims":[{"localId":"jumprelu-sae","kind":"proposition","title":"JumpReLU Sparse Autoencoder (Rajamanoharan et al. 2024 / DeepMind)","verification":"informal_only","review":"needs_review"},{"localId":"matryoshka-sae","kind":"proposition","title":"Matryoshka Sparse Autoencoder (Bushnaq et al. / Bussmann 2024)","verification":"informal_only","review":"needs_review"},{"localId":"sae-objective","kind":"proposition","title":"L1 Sparse Autoencoder (Bricken et al. 2023)","verification":"informal_only","review":"needs_review"},{"localId":"superposition-hypothesis","kind":"proposition","title":"Superposition Hypothesis","verification":"informal_only","review":"needs_review"},{"localId":"topk-sae","kind":"proposition","title":"TopK Sparse Autoencoder (Gao et al. 2024 / OpenAI)","verification":"informal_only","review":"needs_review"}]},{"topic":"sparse-recovery-and-compressed-sensing","url":"https://theorempath.com/topics/sparse-recovery-and-compressed-sensing","title":"Sparse Recovery and Compressed Sensing","reviewedOn":"2026-04-26","claims":[{"localId":"basis-pursuit-recovery","kind":"theorem","title":"Stable Recovery in the Noisy Case","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"gaussian-rip-theorem","kind":"theorem","title":"Random Gaussian Matrices Satisfy RIP","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"rip-exact-recovery","kind":"theorem","title":"Exact Sparse Recovery via RIP and Basis Pursuit","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"spectral-clustering","url":"https://theorempath.com/topics/spectral-clustering","title":"Spectral Clustering","reviewedOn":"2026-04-14","claims":[{"localId":"cheeger-inequality","kind":"theorem","title":"Cheeger Inequality","verification":"informal_only","review":"needs_review"},{"localId":"graph-laplacian-properties","kind":"proposition","title":"Properties of the Graph Laplacian","verification":"informal_only","review":"draft"}]},{"topic":"spectral-theory-of-operators","url":"https://theorempath.com/topics/spectral-theory-of-operators","title":"Spectral Theory of Operators","reviewedOn":"2026-04-18","claims":[{"localId":"courant-fischer-minmax","kind":"theorem","title":"Min-Max Characterization of Eigenvalues (Courant-Fischer)","verification":"informal_only","review":"needs_review"},{"localId":"spectral-theorem-compact","kind":"theorem","title":"Spectral Theorem for Compact Self-Adjoint Operators","verification":"informal_only","review":"needs_review"}]},{"topic":"speculative-decoding-and-quantization","url":"https://theorempath.com/topics/speculative-decoding-and-quantization","title":"Speculative Decoding and Quantization","reviewedOn":"2026-05-25","claims":[{"localId":"quantization-error-bound","kind":"proposition","title":"Per-Layer Quantization Error","verification":"informal_only","review":"needs_review"},{"localId":"speculative-decoding-correctness","kind":"theorem","title":"Speculative Decoding Preserves Target Distribution","verification":"informal_only","review":"needs_review"}]},{"topic":"speech-and-audio-ml","url":"https://theorempath.com/topics/speech-and-audio-ml","title":"Speech and Audio ML","reviewedOn":"2026-04-14","claims":[{"localId":"ctc-marginalization","kind":"proposition","title":"CTC Loss via Marginalization over Alignments","verification":"informal_only","review":"needs_review"}]},{"topic":"spiking-neural-networks","url":"https://theorempath.com/topics/spiking-neural-networks","title":"Spiking Neural Networks","reviewedOn":"2026-04-27","claims":[{"localId":"snn-event-driven-efficiency","kind":"proposition","title":"Event-Driven Efficiency Principle","verification":"informal_only","review":"needs_review"}]},{"topic":"split-conformal-prediction","url":"https://theorempath.com/topics/split-conformal-prediction","title":"Split Conformal Prediction","reviewedOn":"2026-04-24","claims":[{"localId":"conditional-coverage-impossibility","kind":"theorem","title":"Conditional Coverage Is Distribution-Free Impossible","verification":"informal_only","review":"needs_review"},{"localId":"split-conformal-coverage","kind":"theorem","title":"Split Conformal Coverage","verification":"informal_only","review":"needs_review"}]},{"topic":"squeezed-rejection-sampling","url":"https://theorempath.com/topics/squeezed-rejection-sampling","title":"Squeezed Rejection Sampling","reviewedOn":"2026-04-14","claims":[{"localId":"squeeze-correctness","kind":"theorem","title":"Correctness of Squeezed Rejection Sampling","verification":"informal_only","review":"needs_review"}]},{"topic":"stability-and-optimization-dynamics","url":"https://theorempath.com/topics/stability-and-optimization-dynamics","title":"Stability and Optimization Dynamics","reviewedOn":"2026-04-26","claims":[{"localId":"descent-lemma","kind":"lemma","title":"Descent Lemma","verification":"informal_only","review":"needs_review"},{"localId":"gd-convergence-smooth-convex","kind":"theorem","title":"GD Convergence for Smooth Convex Functions","verification":"informal_only","review":"needs_review"},{"localId":"gd-convergence-smooth-strongly-convex","kind":"theorem","title":"GD Convergence for Smooth Strongly Convex Functions","verification":"informal_only","review":"needs_review"}]},{"topic":"state-space-models","url":"https://theorempath.com/topics/state-space-models","title":"State Space Models","reviewedOn":"2026-05-06","claims":[{"localId":"arima-state-space-equivalence","kind":"theorem","title":"ARIMA-State Space Equivalence","verification":"informal_only","review":"needs_review"},{"localId":"kalman-gain-mmse","kind":"theorem","title":"Kalman Gain Minimizes Posterior MSE","verification":"informal_only","review":"needs_review"},{"localId":"rts-smoother-recursion","kind":"theorem","title":"Rauch-Tung-Striebel Smoother","verification":"informal_only","review":"needs_review"}]},{"topic":"statistical-paradoxes-collection","url":"https://theorempath.com/topics/statistical-paradoxes-collection","title":"Statistical Paradoxes Collection","reviewedOn":"2026-04-13","claims":[{"localId":"freedmans-paradox-theorem","kind":"proposition","title":"Freedmans Paradox","verification":"informal_only","review":"needs_review"},{"localId":"lindleys-paradox-theorem","kind":"proposition","title":"Lindleys Paradox","verification":"informal_only","review":"needs_review"}]},{"topic":"statistical-significance-and-multiple-comparisons","url":"https://theorempath.com/topics/statistical-significance-and-multiple-comparisons","title":"Statistical Significance and Multiple Comparisons","reviewedOn":"2026-04-18","claims":[{"localId":"benjamini-hochberg-fdr-control","kind":"theorem","title":"Benjamini-Hochberg Procedure","verification":"informal_only","review":"needs_review"},{"localId":"bonferroni-fwer-guarantee","kind":"theorem","title":"Bonferroni Correction","verification":"informal_only","review":"needs_review"}]},{"topic":"steins-paradox","url":"https://theorempath.com/topics/steins-paradox","title":"Stein's Paradox","reviewedOn":"2026-04-26","claims":[{"localId":"james-stein-dominance-theorem","kind":"theorem","title":"James-Stein Dominance","verification":"informal_only","review":"needs_review"}]},{"topic":"stochastic-approximation-theory","url":"https://theorempath.com/topics/stochastic-approximation-theory","title":"Stochastic Approximation Theory","reviewedOn":"2026-04-26","claims":[{"localId":"ode-method-convergence","kind":"theorem","title":"ODE Method for Stochastic Approximation","verification":"informal_only","review":"needs_review"},{"localId":"polyak-ruppert-averaging","kind":"theorem","title":"Polyak-Ruppert Averaging","verification":"informal_only","review":"needs_review"},{"localId":"robbins-monro-convergence","kind":"theorem","title":"Robbins-Monro Convergence","verification":"informal_only","review":"needs_review"}]},{"topic":"stochastic-calculus-for-ml","url":"https://theorempath.com/topics/stochastic-calculus-for-ml","title":"Stochastic Calculus for ML","reviewedOn":"2026-04-26","claims":[{"localId":"existence-uniqueness-sde","kind":"theorem","title":"Existence and Uniqueness for SDEs","verification":"informal_only","review":"needs_review"},{"localId":"ito-isometry","kind":"theorem","title":"Ito Isometry","verification":"informal_only","review":"draft"},{"localId":"itos-lemma","kind":"theorem","title":"Ito's Lemma","verification":"informal_only","review":"needs_review"}]},{"topic":"stochastic-differential-equations","url":"https://theorempath.com/topics/stochastic-differential-equations","title":"Stochastic Differential Equations","reviewedOn":"2026-04-26","claims":[{"localId":"euler-maruyama-convergence","kind":"theorem","title":"Euler-Maruyama Convergence","verification":"informal_only","review":"needs_review"},{"localId":"sde-existence-uniqueness","kind":"theorem","title":"Existence and Uniqueness for SDEs","verification":"informal_only","review":"needs_review"}]},{"topic":"stochastic-gradient-descent-convergence","url":"https://theorempath.com/topics/stochastic-gradient-descent-convergence","title":"Stochastic Gradient Descent Convergence","reviewedOn":"2026-07-03","claims":[{"localId":"sgd-convex-convergence","kind":"theorem","title":"SGD Convergence for Convex Functions","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"sgd-strongly-convex-convergence","kind":"theorem","title":"SGD Convergence for Strongly Convex Functions","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"stochastic-processes-ml","url":"https://theorempath.com/topics/stochastic-processes-ml","title":"Stochastic Processes for ML","reviewedOn":"2026-05-06","claims":[{"localId":"azuma-hoeffding-mds","kind":"theorem","title":"Azuma-Hoeffding for Bounded MDS","verification":"informal_only","review":"needs_review"},{"localId":"empirical-process-clt","kind":"theorem","title":"Donsker's Theorem (Functional CLT)","verification":"informal_only","review":"needs_review"},{"localId":"infinite-width-gp-correspondence","kind":"theorem","title":"Neural Network Gaussian Process Correspondence","verification":"informal_only","review":"needs_review"},{"localId":"kolmogorov-continuity-criterion","kind":"theorem","title":"Kolmogorov Continuity Criterion","verification":"informal_only","review":"needs_review"}]},{"topic":"structured-output-and-constrained-generation","url":"https://theorempath.com/topics/structured-output-and-constrained-generation","title":"Structured Output and Constrained Generation","reviewedOn":"2026-05-26","claims":[{"localId":"constrained-decoding-validity","kind":"proposition","title":"Constrained Decoding Guarantees Valid Output","verification":"informal_only","review":"needs_review"}]},{"topic":"student-t-distribution-and-t-test","url":"https://theorempath.com/topics/student-t-distribution-and-t-test","title":"Student-t Distribution and t-Test","reviewedOn":"2026-05-11","claims":[{"localId":"one-sample-t-test","kind":"theorem","title":"One-Sample t-Test","verification":"informal_only","review":"needs_review"},{"localId":"paired-t-test","kind":"theorem","title":"Paired t-Test","verification":"informal_only","review":"needs_review"},{"localId":"student-t-construction","kind":"theorem","title":"Student-t as Ratio of Normal and Root Chi-squared","verification":"informal_only","review":"needs_review"},{"localId":"two-sample-t-test-equal-variance","kind":"theorem","title":"Two-Sample t-Test with Common Variance","verification":"informal_only","review":"needs_review"},{"localId":"welch-t-test","kind":"theorem","title":"Welch t-Test for Unequal Variances","verification":"informal_only","review":"needs_review"}]},{"topic":"subexponential-random-variables","url":"https://theorempath.com/topics/subexponential-random-variables","title":"Sub-Exponential Random Variables","reviewedOn":"2026-04-18","claims":[{"localId":"subexponential-bernstein-inequality","kind":"theorem","title":"Bernstein Inequality for Sub-Exponential Sums","verification":"informal_only","review":"needs_review"},{"localId":"subgaussian-product-is-subexponential","kind":"theorem","title":"Products of Sub-Gaussians are Sub-Exponential","verification":"informal_only","review":"draft"}]},{"topic":"subgaussian-random-variables","url":"https://theorempath.com/topics/subgaussian-random-variables","title":"Sub-Gaussian Random Variables","reviewedOn":"2026-04-26","claims":[{"localId":"hoeffding-lemma","kind":"lemma","title":"Hoeffding's Lemma","verification":"lean_verified","review":"source_checked","sourceRoles":["proof"]},{"localId":"subgaussian-linear-combination","kind":"theorem","title":"Closure Under Independent Sums","verification":"lean_verified","review":"source_checked","sourceRoles":["proof"]},{"localId":"subgaussian-maxima","kind":"theorem","title":"Maximum of Sub-Gaussians","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"subgaussian-mgf-characterization","kind":"theorem","title":"Sub-Gaussian MGF Implies Tail Bound","verification":"lean_verified","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"subgradients-and-subdifferentials","url":"https://theorempath.com/topics/subgradients-and-subdifferentials","title":"Subgradients and Subdifferentials","reviewedOn":"2026-08-04","claims":[{"localId":"subdifferential-optimality","kind":"theorem","title":"Subdifferential Optimality Condition","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"subgradient-existence","kind":"theorem","title":"Existence of Subgradients","verification":"informal_only","review":"needs_review"},{"localId":"subgradient-method-convergence","kind":"theorem","title":"Subgradient Method Convergence Rate","verification":"informal_only","review":"needs_review"}]},{"topic":"submodular-optimization","url":"https://theorempath.com/topics/submodular-optimization","title":"Submodular Optimization","reviewedOn":"2026-04-14","claims":[{"localId":"greedy-submodular-guarantee","kind":"theorem","title":"Greedy Approximation for Monotone Submodular Maximization","verification":"informal_only","review":"needs_review"},{"localId":"submodular-np-hardness","kind":"theorem","title":"Hardness of Submodular Maximization","verification":"informal_only","review":"needs_review"}]},{"topic":"sufficient-statistics-and-exponential-families","url":"https://theorempath.com/topics/sufficient-statistics-and-exponential-families","title":"Sufficient Statistics and Exponential Families","reviewedOn":"2026-04-26","claims":[{"localId":"neyman-fisher-factorization","kind":"theorem","title":"Neyman-Fisher Factorization Theorem","verification":"informal_only","review":"needs_review"},{"localId":"rao-blackwell-theorem","kind":"theorem","title":"Rao-Blackwell Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"support-vector-machines","url":"https://theorempath.com/topics/support-vector-machines","title":"Support Vector Machines","reviewedOn":"2026-05-03","claims":[{"localId":"hard-margin-svm-dual","kind":"theorem","title":"Hard Margin SVM Dual Problem","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"representer-theorem-svm","kind":"theorem","title":"Representer Theorem for SVMs","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"survey-sampling-methods","url":"https://theorempath.com/topics/survey-sampling-methods","title":"Survey Sampling Methods","reviewedOn":"2026-04-17","claims":[{"localId":"horvitz-thompson-unbiasedness","kind":"theorem","title":"Horvitz-Thompson Estimator","verification":"informal_only","review":"needs_review"}]},{"topic":"survival-analysis","url":"https://theorempath.com/topics/survival-analysis","title":"Survival Analysis","reviewedOn":"2026-04-26","claims":[{"localId":"cox-partial-likelihood","kind":"theorem","title":"Cox Partial Likelihood","verification":"informal_only","review":"needs_review"},{"localId":"kaplan-meier-consistency","kind":"theorem","title":"Consistency of the Kaplan-Meier Estimator","verification":"informal_only","review":"needs_review"}]},{"topic":"symmetrization-inequality","url":"https://theorempath.com/topics/symmetrization-inequality","title":"Symmetrization Inequality","reviewedOn":"2026-04-22","claims":[{"localId":"desymmetrization-inequality","kind":"proposition","title":"Desymmetrization (Lower Bound)","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"finite-sample-rademacher-symmetrization","kind":"theorem","title":"Expected finite-sample Rademacher symmetrization (Lean-verified)","verification":"lean_verified","review":"source_checked","sourceRoles":["proof"]},{"localId":"one-sample-finite-class-symmetrization","kind":"lemma","title":"One-sample finite-class symmetrization (Lean-verified)","verification":"lean_verified","review":"draft"},{"localId":"symmetrization-inequality-theorem","kind":"theorem","title":"Symmetrization Inequality","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"synthetic-data-distillation","url":"https://theorempath.com/topics/synthetic-data-distillation","title":"Synthetic Data Distillation","reviewedOn":"2026-05-27","claims":[{"localId":"synthetic-distillation-objective","kind":"proposition","title":"Synthetic-Data Distillation as a Lower-Variance Target","verification":"informal_only","review":"needs_review"}]},{"topic":"synthetic-data-generation","url":"https://theorempath.com/topics/synthetic-data-generation","title":"Synthetic Data Generation","reviewedOn":"2026-05-27","claims":[{"localId":"model-collapse-theorem","kind":"theorem","title":"Model Collapse from Recursive Training","verification":"informal_only","review":"needs_review"}]},{"topic":"table-extraction-and-structure-recognition","url":"https://theorempath.com/topics/table-extraction-and-structure-recognition","title":"Table Extraction and Structure Recognition","reviewedOn":"2026-04-26","claims":[{"localId":"table-structure-as-graph-prediction","kind":"proposition","title":"Table Structure Recognition as Cell Adjacency Prediction","verification":"informal_only","review":"needs_review"}]},{"topic":"tabu-search","url":"https://theorempath.com/topics/tabu-search","title":"Tabu Search","reviewedOn":"2026-04-14","claims":[{"localId":"tabu-search-finite-convergence","kind":"theorem","title":"Finite Convergence of Tabu Search","verification":"informal_only","review":"needs_review"}]},{"topic":"tabular-foundation-models-bayesian-inference","url":"https://theorempath.com/topics/tabular-foundation-models-bayesian-inference","title":"Tabular Foundation Models as Bayesian Inference Engines","reviewedOn":"2026-08-08","claims":[{"localId":"pfn-posterior-predictive-consistency","kind":"theorem","title":"The Posterior Predictive Minimizes PFN Population Cross-Entropy","verification":"informal_only","review":"needs_review"}]},{"topic":"taylor-expansion","url":"https://theorempath.com/topics/taylor-expansion","title":"Taylor Expansion","reviewedOn":"2026-08-01","claims":[{"localId":"taylor-remainder-lagrange","kind":"theorem","title":"Taylor Theorem with Lagrange Remainder","verification":"informal_only","review":"needs_review"}]},{"topic":"td-learning","url":"https://theorempath.com/topics/td-learning","title":"Temporal Difference Learning","reviewedOn":"2026-04-14","claims":[{"localId":"td-zero-convergence","kind":"theorem","title":"TD(0) Convergence","verification":"informal_only","review":"needs_review"}]},{"topic":"td3","url":"https://theorempath.com/topics/td3","title":"TD3: Twin Delayed Deep Deterministic Policy Gradient","reviewedOn":"2026-04-17","claims":[{"localId":"clipped-double-q-downward-bias","kind":"proposition","title":"Minimum of Two Unbiased Estimators is Downward-Biased","verification":"informal_only","review":"needs_review"}]},{"topic":"tensors-and-tensor-operations","url":"https://theorempath.com/topics/tensors-and-tensor-operations","title":"Tensors and Tensor Operations","reviewedOn":"2026-04-26","claims":[{"localId":"tensor-universality","kind":"theorem","title":"Universality of Tensor Product","verification":"informal_only","review":"needs_review"}]},{"topic":"test-time-compute-and-search","url":"https://theorempath.com/topics/test-time-compute-and-search","title":"Test-Time Compute and Search","reviewedOn":"2026-07-05","claims":[{"localId":"best-of-n-scaling","kind":"proposition","title":"Best-of-N Scaling with a Perfect Verifier","verification":"informal_only","review":"needs_review"},{"localId":"scoped-test-time-scaling","kind":"proposition","title":"When Test-Time Scaling Helps","verification":"informal_only","review":"needs_review"}]},{"topic":"test-time-training","url":"https://theorempath.com/topics/test-time-training","title":"Test-Time Training and Adaptive Inference","reviewedOn":"2026-05-27","claims":[{"localId":"ttt-layer-formulation","kind":"proposition","title":"TTT Layer: Learning as State Update","verification":"informal_only","review":"needs_review"}]},{"topic":"the-hessian-matrix","url":"https://theorempath.com/topics/the-hessian-matrix","title":"The Hessian Matrix","reviewedOn":"2026-04-26","claims":[{"localId":"second-derivative-test-multivariate","kind":"theorem","title":"Second Derivative Test (Multivariate)","verification":"informal_only","review":"needs_review"}]},{"topic":"the-jacobian-matrix","url":"https://theorempath.com/topics/the-jacobian-matrix","title":"The Jacobian Matrix","reviewedOn":"2026-04-26","claims":[{"localId":"chain-rule-jacobians","kind":"theorem","title":"Chain Rule for Jacobians","verification":"informal_only","review":"needs_review"},{"localId":"inverse-function-theorem","kind":"theorem","title":"Inverse Function Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"thin-plate-splines","url":"https://theorempath.com/topics/thin-plate-splines","title":"Thin-Plate Splines","reviewedOn":"2026-05-13","claims":[{"localId":"thin-plate-representer","kind":"theorem","title":"Thin-Plate Spline Representation (Duchon 1977)","verification":"informal_only","review":"needs_review"}]},{"topic":"time-reversal-of-sdes","url":"https://theorempath.com/topics/time-reversal-of-sdes","title":"Time Reversal of SDEs","reviewedOn":"2026-04-18","claims":[{"localId":"anderson-time-reversal","kind":"theorem","title":"Anderson's Time-Reversal Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"time-series-forecasting-basics","url":"https://theorempath.com/topics/time-series-forecasting-basics","title":"Time Series Forecasting Basics","reviewedOn":"2026-04-14","claims":[{"localId":"ar-stationarity-condition","kind":"theorem","title":"AR(p) Stationarity Condition","verification":"informal_only","review":"needs_review"},{"localId":"wold-decomposition","kind":"theorem","title":"Wold Decomposition Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"time-series-foundations","url":"https://theorempath.com/topics/time-series-foundations","title":"Time Series Foundations","reviewedOn":"2026-05-06","claims":[{"localId":"ar-characteristic-roots","kind":"theorem","title":"Stationarity Condition for AR(p)","verification":"informal_only","review":"needs_review"},{"localId":"spectral-representation-stationary","kind":"theorem","title":"Spectral Representation Theorem","verification":"informal_only","review":"needs_review"},{"localId":"wold-decomposition-theorem","kind":"theorem","title":"Wold Decomposition (Wold 1938)","verification":"informal_only","review":"needs_review"}]},{"topic":"token-prediction-and-language-modeling","url":"https://theorempath.com/topics/token-prediction-and-language-modeling","title":"Token Prediction and Language Modeling","reviewedOn":"2026-04-14","claims":[{"localId":"chain-rule-factorization","kind":"theorem","title":"Chain Rule Factorization for Language Models","verification":"informal_only","review":"needs_review"},{"localId":"perplexity-cross-entropy-equivalence","kind":"proposition","title":"Perplexity Equals Exponentiated Cross-Entropy","verification":"informal_only","review":"needs_review"}]},{"topic":"tokenization-and-information-theory","url":"https://theorempath.com/topics/tokenization-and-information-theory","title":"Tokenization and Information Theory","reviewedOn":"2026-04-26","claims":[{"localId":"tokenization-entropy-connection","kind":"proposition","title":"Tokenization Length and Source Entropy","verification":"informal_only","review":"needs_review"}]},{"topic":"tool-augmented-reasoning","url":"https://theorempath.com/topics/tool-augmented-reasoning","title":"Tool-Augmented Reasoning","reviewedOn":"2026-05-27","claims":[{"localId":"tool-augmented-accuracy-bound","kind":"proposition","title":"Code Execution Eliminates Computation Errors on Verifiable Tasks","verification":"informal_only","review":"needs_review"}]},{"topic":"total-variation-distance","url":"https://theorempath.com/topics/total-variation-distance","title":"Total Variation Distance","reviewedOn":"2026-05-04","claims":[{"localId":"le-cam-two-point","kind":"theorem","title":"Le Cam's Two-Point Inequality","verification":"informal_only","review":"needs_review"},{"localId":"maximal-coupling-tv","kind":"theorem","title":"Coupling Characterization of Total Variation","verification":"informal_only","review":"needs_review"},{"localId":"tv-dual-form","kind":"theorem","title":"Equivalent Forms of Total Variation","verification":"informal_only","review":"needs_review"}]},{"topic":"train-test-split-and-data-leakage","url":"https://theorempath.com/topics/train-test-split-and-data-leakage","title":"Train-Test Split and Data Leakage","reviewedOn":"2026-04-26","claims":[{"localId":"leakage-breaks-evaluation-boundary","kind":"proposition","title":"Leakage Breaks the Evaluation Boundary","verification":"informal_only","review":"draft"}]},{"topic":"training-dynamics-and-loss-landscapes","url":"https://theorempath.com/topics/training-dynamics-and-loss-landscapes","title":"Training Dynamics and Loss Landscapes","reviewedOn":"2026-04-18","claims":[{"localId":"flat-minima-generalization","kind":"proposition","title":"Flat Minima Generalize Better","verification":"informal_only","review":"needs_review"},{"localId":"saddle-point-dominance","kind":"theorem","title":"Saddle Points Dominate in High Dimensions","verification":"informal_only","review":"draft"}]},{"topic":"transfer-learning","url":"https://theorempath.com/topics/transfer-learning","title":"Transfer Learning","reviewedOn":"2026-04-14","claims":[{"localId":"ben-david-domain-adaptation-bound","kind":"theorem","title":"Ben-David Domain Adaptation Bound","verification":"informal_only","review":"needs_review"}]},{"topic":"transformer-architecture","url":"https://theorempath.com/topics/transformer-architecture","title":"Transformer Architecture","reviewedOn":"2026-08-04","claims":[{"localId":"attention-complexity","kind":"proposition","title":"Attention is Quadratic in Sequence Length","verification":"informal_only","review":"needs_review"},{"localId":"attention-output-dimension","kind":"proposition","title":"Attention Dimensions","verification":"informal_only","review":"needs_review"},{"localId":"parameter-count-formula","kind":"proposition","title":"Transformer Parameter Count","verification":"informal_only","review":"needs_review"}]},{"topic":"triangular-distribution","url":"https://theorempath.com/topics/triangular-distribution","title":"Triangular Distribution","reviewedOn":"2026-04-22","claims":[{"localId":"sum-of-uniforms-is-triangular","kind":"theorem","title":"Sum of Two Uniforms Is Triangular","verification":"informal_only","review":"needs_review"},{"localId":"triangular-distribution-cdf","kind":"theorem","title":"Triangular Distribution CDF","verification":"informal_only","review":"needs_review"},{"localId":"triangular-distribution-moments","kind":"theorem","title":"Mean and Variance","verification":"informal_only","review":"draft"}]},{"topic":"trust-region-methods","url":"https://theorempath.com/topics/trust-region-methods","title":"Trust Region Methods","reviewedOn":"2026-04-26","claims":[{"localId":"cauchy-point-decrease","kind":"lemma","title":"Cauchy Point Sufficient Decrease","verification":"informal_only","review":"needs_review"},{"localId":"trust-region-global-convergence","kind":"theorem","title":"Global First-Order Convergence","verification":"informal_only","review":"needs_review"},{"localId":"trust-region-optimality-conditions","kind":"theorem","title":"Trust Region Subproblem Optimality Conditions","verification":"informal_only","review":"needs_review"}]},{"topic":"truth-directions-and-linear-probes","url":"https://theorempath.com/topics/truth-directions-and-linear-probes","title":"Truth Directions and Linear Probes","reviewedOn":"2026-05-26","claims":[{"localId":"final-layer-steering-logit-shift","kind":"proposition","title":"At the final residual stream, steering changes logits linearly","verification":"informal_only","review":"needs_review"},{"localId":"perfect-probe-can-still-be-noncausal","kind":"proposition","title":"A perfect probe can still track the wrong feature","verification":"informal_only","review":"needs_review"}]},{"topic":"tsne-and-umap","url":"https://theorempath.com/topics/tsne-and-umap","title":"t-SNE and UMAP","reviewedOn":"2026-04-13","claims":[{"localId":"tsne-crowding-solution","kind":"proposition","title":"Heavy Tails Solve the Crowding Problem","verification":"informal_only","review":"draft"},{"localId":"umap-fuzzy-topological","kind":"proposition","title":"UMAP as Fuzzy Simplicial Set Matching","verification":"informal_only","review":"draft"}]},{"topic":"tweedie-distribution","url":"https://theorempath.com/topics/tweedie-distribution","title":"Tweedie Distribution","reviewedOn":"2026-05-12","claims":[{"localId":"tweedie-compound-poisson-gamma-representation","kind":"theorem","title":"Compound Poisson-Gamma Representation in the Range 1 to 2","verification":"informal_only","review":"needs_review"},{"localId":"tweedie-variance-function-characterization","kind":"theorem","title":"Tweedie Family as Power-Variance EDMs","verification":"informal_only","review":"needs_review"}]},{"topic":"type-theory","url":"https://theorempath.com/topics/type-theory","title":"Type Theory","reviewedOn":"2026-04-26","claims":[{"localId":"curry-howard-correspondence","kind":"theorem","title":"Curry-Howard Correspondence","verification":"informal_only","review":"needs_review"}]},{"topic":"types-of-bias-in-statistics","url":"https://theorempath.com/topics/types-of-bias-in-statistics","title":"Types of Bias in Statistics","reviewedOn":"2026-04-14","claims":[{"localId":"selection-bias-bound","kind":"theorem","title":"Selection Bias Decomposition","verification":"informal_only","review":"draft"}]},{"topic":"understanding-machine-learning-book","url":"https://theorempath.com/topics/understanding-machine-learning-book","title":"Understanding Machine Learning (Shalev-Shwartz, Ben-David)","reviewedOn":"2026-04-14","claims":[{"localId":"uml-fundamental-theorem","kind":"theorem","title":"Fundamental Theorem of Statistical Learning (UML Ch 6, Thm 6.7)","verification":"informal_only","review":"needs_review"}]},{"topic":"uniform-convergence","url":"https://theorempath.com/topics/uniform-convergence","title":"Uniform Convergence","reviewedOn":"2026-04-26","claims":[{"localId":"epsilon-representative-sample","kind":"lemma","title":"Epsilon-Representative Implies ERM Works","verification":"lean_verified","review":"source_checked","sourceRoles":["proof"]},{"localId":"finite-class-uniform-convergence","kind":"theorem","title":"Uniform Convergence for Finite Classes","verification":"lean_verified","review":"source_checked","sourceRoles":["proof"]},{"localId":"uniform-convergence-implies-erm-learns","kind":"theorem","title":"Uniform Convergence is Sufficient for Learnability","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]},{"localId":"vc-style-uniform-deviation-bound","kind":"theorem","title":"VC-Style Two-Sided Uniform Deviation Bound","verification":"lean_verified","review":"needs_review"}]},{"topic":"universal-approximation-theorem","url":"https://theorempath.com/topics/universal-approximation-theorem","title":"Universal Approximation Theorem","reviewedOn":"2026-04-14","claims":[{"localId":"cybenko-universal-approximation","kind":"theorem","title":"Universal Approximation (Cybenko, 1989)","verification":"informal_only","review":"needs_review"},{"localId":"depth-separation","kind":"theorem","title":"Depth Separation","verification":"informal_only","review":"needs_review"}]},{"topic":"unsolved-problems-in-computer-science","url":"https://theorempath.com/topics/unsolved-problems-in-computer-science","title":"Unsolved Problems in Computer Science","reviewedOn":"2026-04-26","claims":[{"localId":"impagliazzos-worlds","kind":"proposition","title":"Impagliazzos Five Worlds","verification":"informal_only","review":"needs_review"},{"localId":"natural-proofs-barrier","kind":"theorem","title":"Razborov-Rudich Natural Proofs Barrier","verification":"informal_only","review":"needs_review"}]},{"topic":"value-iteration-and-policy-iteration","url":"https://theorempath.com/topics/value-iteration-and-policy-iteration","title":"Value Iteration and Policy Iteration","reviewedOn":"2026-04-13","claims":[{"localId":"policy-iteration-finite-termination","kind":"theorem","title":"Policy Iteration Terminates in Finite Steps","verification":"informal_only","review":"needs_review"},{"localId":"value-iteration-convergence","kind":"theorem","title":"Value Iteration Converges Geometrically","verification":"informal_only","review":"needs_review"}]},{"topic":"variance-reduction-techniques","url":"https://theorempath.com/topics/variance-reduction-techniques","title":"Variance Reduction Techniques","reviewedOn":"2026-04-13","claims":[{"localId":"control-variate-optimal-coefficient","kind":"proposition","title":"Optimal Control Variate Coefficient","verification":"informal_only","review":"needs_review"},{"localId":"rao-blackwell-variance-reduction","kind":"theorem","title":"Rao-Blackwell Theorem (Variance Reduction)","verification":"informal_only","review":"needs_review"}]},{"topic":"variance-stabilizing-transformations","url":"https://theorempath.com/topics/variance-stabilizing-transformations","title":"Variance-Stabilizing Transformations","reviewedOn":"2026-05-12","claims":[{"localId":"binomial-arcsin-vst","kind":"theorem","title":"Arcsin-Square-Root Stabilizes the Binomial Proportion Variance","verification":"informal_only","review":"draft"},{"localId":"fisher-z-correlation-vst","kind":"theorem","title":"Fisher z-Transform Stabilizes the Sample Correlation Variance","verification":"informal_only","review":"draft"},{"localId":"poisson-square-root-vst","kind":"theorem","title":"Square-Root Stabilizes the Poisson Variance","verification":"informal_only","review":"needs_review"},{"localId":"variance-stabilizing-ode","kind":"theorem","title":"The Variance-Stabilizing ODE","verification":"informal_only","review":"needs_review"}]},{"topic":"variational-autoencoders","url":"https://theorempath.com/topics/variational-autoencoders","title":"Variational Autoencoders","reviewedOn":"2026-04-26","claims":[{"localId":"elbo-derivation","kind":"theorem","title":"Evidence Lower Bound (ELBO)","verification":"informal_only","review":"needs_review"}]},{"topic":"vc-dimension","url":"https://theorempath.com/topics/vc-dimension","title":"VC Dimension","reviewedOn":"2026-08-04","claims":[{"localId":"binary-vc-zero-one-loss-bridge","kind":"theorem","title":"Binary VC Bridge for Zero-One Loss","verification":"lean_verified","review":"draft"},{"localId":"sauer-shelah-lemma","kind":"lemma","title":"Sauer-Shelah Lemma","verification":"lean_verified","review":"source_checked","sourceRoles":["proof"]},{"localId":"vc-generalization-bound","kind":"theorem","title":"VC Generalization Bound","verification":"source_checked","review":"source_checked","sourceRoles":["proof"]}]},{"topic":"vectors-matrices-and-linear-maps","url":"https://theorempath.com/topics/vectors-matrices-and-linear-maps","title":"Vectors, Matrices, and Linear Maps","reviewedOn":"2026-08-01","claims":[{"localId":"rank-nullity-theorem","kind":"theorem","title":"Rank-Nullity Theorem","verification":"informal_only","review":"needs_review"}]},{"topic":"verifier-design-and-process-reward","url":"https://theorempath.com/topics/verifier-design-and-process-reward","title":"Verifier Design and Process Reward","reviewedOn":"2026-05-25","claims":[{"localId":"best-of-n-scaling","kind":"proposition","title":"Best-of-N Scaling with Verifiers","verification":"informal_only","review":"needs_review"},{"localId":"prm-credit-assignment","kind":"proposition","title":"PRM Credit Assignment Advantage","verification":"informal_only","review":"needs_review"},{"localId":"self-verification-limits","kind":"proposition","title":"Limitations of Self-Verification","verification":"informal_only","review":"needs_review"}]},{"topic":"video-world-models","url":"https://theorempath.com/topics/video-world-models","title":"Video World Models","reviewedOn":"2026-05-26","claims":[{"localId":"video-world-model-fidelity-bound","kind":"theorem","title":"Simulation Lemma for Learned World Models","verification":"informal_only","review":"needs_review"}]},{"topic":"vieta-jumping","url":"https://theorempath.com/topics/vieta-jumping","title":"Vieta Jumping","reviewedOn":"2026-04-13","claims":[{"localId":"vieta-jumping-method","kind":"proposition","title":"Vieta Jumping Produces Integer Solutions","verification":"informal_only","review":"needs_review"}]},{"topic":"vision-transformer-lineage","url":"https://theorempath.com/topics/vision-transformer-lineage","title":"Vision Transformer Lineage: ViT, DeiT, Swin, MAE, DINOv2, SAM","reviewedOn":"2026-04-19","claims":[{"localId":"dino-self-distillation","kind":"proposition","title":"DINO Self-Distillation Objective","verification":"informal_only","review":"needs_review"},{"localId":"mae-asymmetric-encoder-decoder","kind":"proposition","title":"MAE Asymmetric Encoder-Decoder with 75% Masking","verification":"informal_only","review":"needs_review"},{"localId":"register-tokens-attention-artifact","kind":"proposition","title":"Register Tokens Eliminate ViT Attention Artifacts","verification":"informal_only","review":"needs_review"},{"localId":"swin-shifted-window-attention","kind":"proposition","title":"Swin Shifted Window Attention","verification":"informal_only","review":"needs_review"},{"localId":"vit-patch-embedding","kind":"proposition","title":"ViT Patch Embedding and Resolution Scaling","verification":"informal_only","review":"needs_review"}]},{"topic":"visual-semantic-slam","url":"https://theorempath.com/topics/visual-semantic-slam","title":"Visual and Semantic SLAM","reviewedOn":"2026-04-18","claims":[{"localId":"visual-odometry-epipolar-constraint","kind":"theorem","title":"Epipolar Constraint for Visual Odometry","verification":"informal_only","review":"needs_review"}]},{"topic":"wasserstein-distances","url":"https://theorempath.com/topics/wasserstein-distances","title":"Wasserstein Distances","reviewedOn":"2026-04-13","claims":[{"localId":"kantorovich-rubinstein-duality","kind":"theorem","title":"Kantorovich-Rubinstein Duality","verification":"informal_only","review":"needs_review"},{"localId":"wasserstein-convergence-properties","kind":"proposition","title":"Wasserstein Metrizes Weak Convergence","verification":"informal_only","review":"needs_review"}]},{"topic":"wavelet-smoothing","url":"https://theorempath.com/topics/wavelet-smoothing","title":"Wavelet Smoothing","reviewedOn":"2026-04-13","claims":[{"localId":"wavelet-thresholding-risk","kind":"theorem","title":"Minimax Optimality of Wavelet Thresholding","verification":"informal_only","review":"needs_review"}]},{"topic":"webgpu-for-ml","url":"https://theorempath.com/topics/webgpu-for-ml","title":"WebGPU for Machine Learning","reviewedOn":"2026-04-25","claims":[{"localId":"kernel-fusion-traffic-reduction","kind":"proposition","title":"Fusion Wins by Avoiding Intermediate Materialization","verification":"informal_only","review":"needs_review"},{"localId":"memory-bandwidth-pass-bound","kind":"proposition","title":"Memory Passes Give a Hard Lower Bound","verification":"informal_only","review":"needs_review"}]},{"topic":"weibull-distribution","url":"https://theorempath.com/topics/weibull-distribution","title":"Weibull Distribution","reviewedOn":"2026-05-12","claims":[{"localId":"weibull-hazard-monotonicity","kind":"theorem","title":"Weibull Hazard Is Monotone, with Shape Setting the Trend","verification":"informal_only","review":"draft"},{"localId":"weibull-survival-and-moments","kind":"theorem","title":"Weibull Survival Function and Moments","verification":"informal_only","review":"needs_review"}]},{"topic":"weight-initialization","url":"https://theorempath.com/topics/weight-initialization","title":"Weight Initialization","reviewedOn":"2026-04-26","claims":[{"localId":"he-initialization","kind":"theorem","title":"He/Kaiming Initialization","verification":"informal_only","review":"needs_review"},{"localId":"symmetry-breaking-initialization","kind":"proposition","title":"Zero Initialization Fails","verification":"informal_only","review":"needs_review"},{"localId":"xavier-initialization","kind":"theorem","title":"Xavier/Glorot Initialization","verification":"informal_only","review":"draft"}]},{"topic":"weighted-conformal-prediction","url":"https://theorempath.com/topics/weighted-conformal-prediction","title":"Weighted Conformal Prediction Under Covariate Shift","reviewedOn":"2026-04-24","claims":[{"localId":"weighted-conformal-coverage","kind":"theorem","title":"Weighted Conformal Coverage","verification":"informal_only","review":"needs_review"}]},{"topic":"weights-and-biases-experiment-tracking","url":"https://theorempath.com/topics/weights-and-biases-experiment-tracking","title":"Weights and Biases for Experiment Tracking","reviewedOn":"2026-04-18","claims":[{"localId":"run-comparability-principle","kind":"proposition","title":"Run Comparability Principle","verification":"informal_only","review":"draft"}]},{"topic":"whitening-and-decorrelation","url":"https://theorempath.com/topics/whitening-and-decorrelation","title":"Whitening and Decorrelation","reviewedOn":"2026-04-27","claims":[{"localId":"whitening-identity-covariance","kind":"proposition","title":"Whitening Produces Identity Covariance","verification":"informal_only","review":"needs_review"}]},{"topic":"winsorization","url":"https://theorempath.com/topics/winsorization","title":"Winsorization","reviewedOn":"2026-04-14","claims":[{"localId":"winsorized-mean-breakdown","kind":"proposition","title":"Breakdown Point of the Winsorized Mean","verification":"informal_only","review":"draft"}]},{"topic":"word-embeddings","url":"https://theorempath.com/topics/word-embeddings","title":"Word Embeddings","reviewedOn":"2026-04-26","claims":[{"localId":"skipgram-objective","kind":"proposition","title":"Skip-Gram with Negative Sampling Factorizes the PMI Matrix","verification":"informal_only","review":"needs_review"}]},{"topic":"world-model-evaluation","url":"https://theorempath.com/topics/world-model-evaluation","title":"World Model Evaluation","reviewedOn":"2026-05-26","claims":[{"localId":"compounding-model-error-bound","kind":"proposition","title":"Compounding Error in Model-Based RL","verification":"informal_only","review":"needs_review"}]},{"topic":"world-models-and-planning","url":"https://theorempath.com/topics/world-models-and-planning","title":"World Models and Planning","reviewedOn":"2026-05-27","claims":[{"localId":"dreamer-objective","kind":"proposition","title":"Dreamer Imagination-Based Policy Optimization","verification":"informal_only","review":"draft"},{"localId":"model-based-regret-bound","kind":"theorem","title":"Model-Based RL Regret via Simulation Lemma","verification":"informal_only","review":"needs_review"}]},{"topic":"xgboost","url":"https://theorempath.com/topics/xgboost","title":"XGBoost","reviewedOn":"2026-04-13","claims":[{"localId":"xgboost-optimal-leaf-weight","kind":"proposition","title":"Optimal Leaf Weight","verification":"informal_only","review":"needs_review"},{"localId":"xgboost-split-gain","kind":"proposition","title":"XGBoost Split Gain","verification":"informal_only","review":"needs_review"}]},{"topic":"zermelo-fraenkel-set-theory","url":"https://theorempath.com/topics/zermelo-fraenkel-set-theory","title":"Zermelo-Fraenkel Set Theory","reviewedOn":"2026-04-13","claims":[{"localId":"axiom-of-choice-equivalences","kind":"theorem","title":"Equivalence of AC, Zorn's Lemma, and Well-Ordering","verification":"informal_only","review":"needs_review"}]},{"topic":"zero-knowledge-proofs","url":"https://theorempath.com/topics/zero-knowledge-proofs","title":"Zero-Knowledge Proofs","reviewedOn":"2026-04-15","claims":[{"localId":"zk-completeness-theorem","kind":"theorem","title":"Zero-Knowledge Completeness for NP","verification":"informal_only","review":"needs_review"}]}]}