deep_ritz_residual_trial_network
Build smooth residual trial networks for Deep Ritz variational PDE objectives.
- License 许可
- Apache-2.0
- 最近更新
- 2026-09-03
- Stars
- ★ 351
- Forks
- 27
01 前言 Front Matter
- name
- deep_ritz_residual_trial_network
- description
- Build smooth residual trial networks for Deep Ritz variational PDE objectives.
02 资源文件 2
- 脚本scripts/residual_network.py1.9 KB
- 脚本tests/test_residual_network.py1.2 KB
03 SKILL.md 正文
Deep Ritz Residual Trial Network
When To Use
Use this skill when a variational PDE solver needs a scalar neural trial function u(x; theta) whose spatial gradients can be differentiated. Do not use it for mesh-only PDE discretizations.
Inputs
- Spatial dimension.
- Hidden width and residual block count.
- Activation choice, preferably cubic ReLU for Poisson-style Deep Ritz losses.
- Coordinate batch with gradient tracking enabled when a loss needs
grad_x u.
Outputs
- A trainable scalar model.
- Forward values shaped
[batch, 1]. - Input-gradient compatibility for energy losses.
Workflow
- Project coordinates into hidden width.
- Apply residual blocks with two affine transformations and smooth activation.
- Apply a final linear readout.
- Keep the model independent of any original implementation repository.
Validation
Run:
python tests/test_residual_network.py
Limitations
The helper uses PyTorch when available. If PyTorch is unavailable, tests still validate architecture metadata and deterministic parameter counting, but recovery should record that full autograd training is blocked.
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).