Research, software, data and methods. Inspect the context, compare your options, and take a useful next step.
ReScience C
A replication about Thompson sampling and bandit-guided sequence optimization.
Investigate How does Thompson sampling compare with uniform allocation on evaluator-generated finite reward landscapes at equal budgets?
ReScience C
A replication about automated teaching formulated as planning in a partially observable decision process.
Investigate Can a bounded planner match an exact small-state reference on a fixed teaching objective?
ReScience
An R replication of least-cost modeling on irregular landscape graphs using graph and triangulation concepts.
Investigate Does the computed least-cost path agree with an independently enumerated optimum on bounded irregular graphs?
ReScience
A replication about predicting metabolic biomarkers with flux-variability analysis and metabolic reconstruction.
Investigate Can a bounded flux-variability computation recover analytically known feasible ranges in a small network?
ReScience C
A C++ replication about graph ordering as a way to change graph-processing performance.
Investigate Does a chosen ordering preserve algorithm outputs while improving measured performance across graph families?
ReScience C
An R replication of Thompson sampling for bandits whose arms have a cluster structure.
Investigate When the assumed clusters are deliberately incorrect, how does cumulative regret change at a fixed sampling budget?
Upstream project repository
Training and inference orchestration for studying device placement, mixed precision and distributed execution without changing the scientific objective.
Investigate Does one controlled optimization step agree between a single-device reference and a fixed distributed configuration?
CVXPY documentation
A guide to dual variables, transformations, problem arithmetic and canonical forms for convex optimization.
Investigate Do reported primal and dual variables satisfy independently computed feasibility and complementary-slackness checks on small convex problems?
UCI Machine Learning Repository
Auction-verification workload descriptors for examining computational cost prediction.
Investigate How well can a bounded runtime model predict withheld auction configuration families?
Upstream project repository
Bayesian optimization for bounded black-box objective functions.
Investigate Does a fixed acquisition strategy reduce regret faster than a prespecified random-search baseline on a bounded objective?
Upstream project repository
Low-precision tensor and optimizer components for investigating memory and numerical-error tradeoffs.
Investigate How does one supported quantization configuration change a small fixed matrix product relative to a high-precision reference?
Upstream project repository
Assertions and testing utilities for JAX programs, useful for expressing shape, type and transformation expectations.
Investigate Do declared shape and tree invariants detect deliberately malformed inputs to a tiny numerical function?
Recorded license evidence is scoped to each source; it is not a blanket permission or a verification result.