posterior_sampling_baseline
Generate deterministic reference and approximate posterior samples for bounded simulation-based inference recovery experiments.
- License 许可
- Apache-2.0
- 最近更新
- 2026-09-03
- Stars
- ★ 351
- Forks
- 27
01 前言 Front Matter
- name
- posterior_sampling_baseline
- description
- Generate deterministic reference and approximate posterior samples for bounded simulation-based inference recovery experiments.
02 资源文件 2
03 SKILL.md 正文
Posterior Sampling Baseline
Use this skill when an SBI benchmark recovery needs posterior samples to feed into distributional metrics. It consumes a task item from sbibm_task_protocol and emits reference and approximate sample matrices.
Inputs
- Task item JSON containing analytic posterior mean and variance.
- Number of samples, random seed, and approximation mode:
matched,shifted, orwide.
Outputs
- JSON sample file containing reference samples, approximate samples, and sampling metadata.
Workflow
- Read the task item and validate posterior parameters.
- Draw reference samples from the analytic posterior.
- Draw approximate samples from the selected approximation distribution.
- Record sample count, dimension, seed, and approximation mode.
Validation
Run the included tests or validate_skill_tree.py --run-tests.
Limitations
The module is a reduced posterior-sampling baseline, not a full neural SBI algorithm. It is valid for soft-mode proxy recovery when the goal is to exercise the benchmark comparison mechanism.
04 同仓库更多 Skills
passnet-triton-opt
Make a single PassNet Triton kernel fast AND numerically faithful: performance model (when a replacement can win at all), block/grid/warp tuning, autotune policy, launch overhead, and per-op numeric recipes to pass the dtype baseline tolerances. Use when a pass matches and is correct but speedup below expected, or when correctness fails by small numeric margins.
passnet-solve
END-TO-END playbook for solving one PassNet sample: analyze the computation graphs, decide the optimization strategy (what to fuse, what to replace, what to leave alone), drive the iteration loop, and maximize the sample score. This is the ENTRY skill — invoke it first for any PassNet optimization task; it tells you when to use passnet-pattern-fusion, passnet-triton-opt and passnet-feedback.
passnet-skill
PassNet GPU kernel optimization via compiler passes. Design and implement Triton-based optimization passes, create pass files under ./pass_dir/, self-evaluate with pass_evaluator, and iterate to maximize GPU speedup.
passnet-pattern-fusion
Author PassNet pass files: write patterns that actually MATCH the FX graph, pick fusion regions (which ops to absorb into one Triton kernel), and structure multi-pass submissions with the mandatory shared-dispatch architecture. Use when creating or fixing pattern()/replacement_args()/replacement_func() files, when a pass "failed to match", or when deciding how to fuse multiple kernels/ops.
passnet-orchestrate
Round/batch planning and decision support for PassNet graph optimization. Use for multi-sample triage, worker allocation, eval-budget policy, and post-eval keep/revert decisions. For solving one concrete sample end to end, use passnet-solve as the entry skill; consult this skill only when you need broader planning or a specific decision gate.
passnet-feedback
Fast, deterministic feedback for PassNet work: pre-flight pattern/match verification WITHOUT burning a GPU evaluation, per-node bottleneck analysis of a sample's graphs, and eval-log parsing into per-variant status + estimated score + failure classification. Use BEFORE every GPU evaluation (check_pattern), at the START of a sample (analyze_graph), and AFTER every evaluation (parse_eval_log).