Commit 7520224
committed
Fix AssertionError crash in MSD binary search when all alphas are feasible
When the network has excess capacity and every probed alpha up to alpha_max
is feasible, the bracketing phase sets upper = min(alpha_max, lower + 1.0).
Since lower already equals alpha_max at that point, upper == lower, causing
the assertion `lower < upper` to fail with an AssertionError.
Fix: return lower directly when no infeasible upper bound is found, since
the last proven feasible alpha is the best answer available.
https://claude.ai/code/session_013XZpjpJ1MM2jJFXHRdEZVi1 parent 04e88bb commit 7520224
2 files changed
Lines changed: 42 additions & 1 deletion
File tree
- ngraph/workflow
- tests/workflow
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
| |||
229 | 229 | | |
230 | 230 | | |
231 | 231 | | |
232 | | - | |
| 232 | + | |
| 233 | + | |
| 234 | + | |
233 | 235 | | |
234 | 236 | | |
235 | 237 | | |
| |||
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
| |||
228 | 228 | | |
229 | 229 | | |
230 | 230 | | |
| 231 | + | |
| 232 | + | |
| 233 | + | |
| 234 | + | |
| 235 | + | |
| 236 | + | |
| 237 | + | |
| 238 | + | |
| 239 | + | |
| 240 | + | |
| 241 | + | |
| 242 | + | |
| 243 | + | |
| 244 | + | |
| 245 | + | |
| 246 | + | |
| 247 | + | |
| 248 | + | |
| 249 | + | |
| 250 | + | |
| 251 | + | |
| 252 | + | |
| 253 | + | |
| 254 | + | |
| 255 | + | |
| 256 | + | |
| 257 | + | |
| 258 | + | |
| 259 | + | |
| 260 | + | |
| 261 | + | |
| 262 | + | |
| 263 | + | |
| 264 | + | |
| 265 | + | |
| 266 | + | |
| 267 | + | |
| 268 | + | |
| 269 | + | |
0 commit comments