An altpenalty compared against the constant 0 (altpenalty X > 0, X >= 0, 0 < X) is silently ignored, so a failed constraint is charged weight times its primary violation instead
维护者通常 1 天内回复
还没有人认领这个 Issue。
评估
调研方向
阅读 pybnf/constraint.py:338-347 中的 altpenalty 归一化,然后检查第 689 行的 get_static_penalty 和第 889 行的 _static_penalty_gradient 中的检查。使用提供的 obs.prop 和 sim.gdat 示例复现,并验证 penalty 和 gradient 路径都能处理零常数。在受影响的案例产生所列的正确 penalty,且现有控制保持不变时,即可完成。
由索引模型根据 Issue 内容生成。
描述
load_constraint_file turns a numeric side of the altpenalty inequality into a float (pybnf/constraint.py:113-117). Constraint.init then rewrites a >/>= altpenalty as < by swapping its sides (pybnf/constraint.py:338-347). After both steps, altpenalty X > 0, X >= 0, 0 < X and 0 <= X all store alt1 = 0.0, alt2 = 'X'. get_static_penalty uses if self.alt1: (pybnf/constraint.py:689) to decide whether an altpenalty is present. Because 0.0 is falsy, the altpenalty branch is skipped and the penalty becomes weight times the primary inequality's violation. _static_penalty_gradient runs the same test (pybnf/constraint.py:889), so the gradient matches the wrong objective and does not expose the problem. find_keys accepts a float alt1 without complaint (pybnf/constraint.py:421-422, where get_key returns None). No error, warning or log line appears. altpenalty X < 0 is not affected, because there the 0 ends up in alt2.
Failure scenario
docs/config.rst:251 defines the altpenalty rule. When the primary inequality fails, the penalty is weight * max(0, alt1 - alt2). If the altpenalty inequality holds, the penalty is weight * min, or 0 when no min is set. Take A < 1 at 1 weight 10 altpenalty X > 0 with A = 5:
- X = -3: the penalty should be 10 * max(0, 0 - (-3)) = 30. PyBNF returns 40, which is 10 times the primary violation 5 - 1.
- X = +3: the altpenalty inequality holds, so the penalty should be 0. PyBNF returns 40.
- X = +3 with
min 1: the penalty should be 10. PyBNF returns 40.
The error runs in both directions. A parameter set that satisfies the continuous proxy is still charged, and the penalty follows A instead of X, which defeats the purpose of the substitution.
Reproduction
Run from any empty directory with PyBNF importable:
from pybnf import data, constraint
lines = ['A < 1 at 1 weight 10 altpenalty X > 0',
'A < 1 at 1 weight 10 altpenalty 0 < X',
'A < 1 at 1 weight 10 altpenalty X >= 0',
'A < 1 always weight 10 altpenalty X > 0',
'A < 1 at 1 weight 10 altpenalty X > 0 min 1',
'A < 1 at 1 weight 10 altpenalty X > 1e-300 min 1', # control
'A < 1 at 1 weight 10 altpenalty X > 0.5'] # control
with open('obs.prop', 'w') as f:
f.write('\n'.join(lines) + '\n')
for x in (-3, 3):
with open('sim.gdat', 'w') as f:
f.write(f'# time A X\n0 5 {x}\n1 5 {x}\n')
d = data.Data()
d.load_data('sim.gdat')
cs = constraint.ConstraintSet('model', 'obs')
cs.load_constraint_file('obs.prop')
for line, c in zip(lines, cs.constraints):
print(f'X={x:+d} {line:50s} alt1={c.alt1!r:7} penalty={c.penalty({"model": {"obs": d}})}')
| constraint | X | PyBNF | correct |
|---|---|---|---|
altpenalty X > 0 |
-3 | 40.0 | 30 |
altpenalty 0 < X |
-3 | 40.0 | 30 |
altpenalty X >= 0 |
-3 | 40.0 | 30 |
always ... altpenalty X > 0 |
-3 | 40.0 | 30 |
altpenalty X > 0 min 1 |
-3 | 40.0 | 30 |
altpenalty X > 1e-300 min 1 (control) |
-3 | 30.0 | 30 |
altpenalty X > 0.5 (control) |
-3 | 35.0 | 35 |
altpenalty X > 0 |
+3 | 40.0 | 0 |
altpenalty 0 < X |
+3 | 40.0 | 0 |
altpenalty X >= 0 |
+3 | 40.0 | 0 |
always ... altpenalty X > 0 |
+3 | 40.0 | 0 |
altpenalty X > 0 min 1 |
+3 | 40.0 | 10 |
altpenalty X > 1e-300 min 1 (control) |
+3 | 10.0 | 10 |
altpenalty X > 0.5 (control) |
+3 | 0.0 | 0 |
Every affected line prints alt1=0.0. Moving the constant only to 1e-300 gives the correct value.
Reachability
This affects any .prop constraint file (qualitative data read through exp_file / data:) with a weighted constraint whose altpenalty has 0 as its constant side after normalization: X > 0, X >= 0, 0 < X or 0 <= X. It applies to at, between, always and once constraints. The altpenalty grammar accepts a number on either side (pybnf/constraint.py:249-251, :264), and X > 0 is the natural way to say that the continuous proxy should be positive. Nothing upstream rejects the input and nothing downstream corrects it. Gradient-based fits get a gradient consistent with the wrong penalty.
Where
pybnf/constraint.py:689 pybnf/constraint.py:889 pybnf/constraint.py:338-347
The obvious fix is if self.alt1 is not None: at both test sites.
Related: #890, #887.
Found in a whole-codebase audit for silently wrong results (2026-09-23); the reproduction above was re-run independently of the original finding.
- 主要语言
- Python
- 星标
- 25
- 派生
- 25
- 平均合并
- 2 小时 38 分钟
- 30 天内合并 PR
- 98
环境准备
从这里开始
- 先读完整个 Issue,再读项目的贡献指南。
- 在 Issue 下留言说明你要接手 —— 这能避免两个人做同样的事。
- Fork 仓库,在一个分支上完成修改。
- 提交 Pull Request,并在描述里引用这个 Issue 编号。
lanl/PyBNF 的其他 Issue
-
bug silent-incorrectness
难度 2/5 1-3 小时 新手友好度 78/100
维护者通常 1 天内回复
-
bug
难度 2/5 1-3 小时 新手友好度 82/100
维护者通常 1 天内回复
-
documentation
难度 1/5 1 小时以内 新手友好度 91/100
维护者通常 1 天内回复
-
bug silent-incorrectness
难度 2/5 1-3 小时 新手友好度 82/100
维护者通常 1 天内回复
-
bug silent-incorrectness
难度 2/5 1-3 小时 新手友好度 76/100
维护者通常 1 天内回复
相似的 Issue
-
[Bug] @deck.gl/arcgis dist import resolves to unpublished @deck.gl/core source path (9.3.11, 9.4.0)未关闭
难度 2/5 1-3 小时 新手友好度 72/100
维护者通常 1 天内回复
-
workflow: a tick's dispatch counts as 'only this step', and no review self-grants a round unattended未关闭workflow
难度 2/5 1-3 小时 新手友好度 85/100
kristofdegrave/homeassistant-smart-charging#1505 ·
维护者通常 1 天内回复
-
metadata submission
难度 2/5 1-3 小时 新手友好度 82/100
-
bug
难度 2/5 1-3 小时 新手友好度 65/100
canonical/content-cache-operator#163 · 1 条评论 ·
维护者通常 1 天内回复
-
[submission]未关闭submission
难度 1/5 1 小时以内 新手友好度 65/100
leanprover/lean-eval-submissions#1852 ·
维护者通常 1 天内回复