claim
active
claim:the-dwell-time-near-a-saddle-depends-on-the-number-of-outgoing-escape-downhill-directionsThe dwell time near a saddle depends on the number of outgoing escape (downhill) directions
General dynamical-systems principle the authors invoke to explain variable saddle trapping durations.
Source paper
extracted_from(2026) · Jeffrey Lai · Anthony Bao · J. Quinn · William Gilpin
Neighborhood — ranked by edge-count
Papers (1)
paper
Claims (1)
claim
- Constraint-solving problems are hardest near the constrainedness transition, where few distinct correct routes remainassociated_withInterpretive claim linking classical constraint-satisfaction hardness theory to the paper's saddle-based account.
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Second global feature for Claremont Canyon.
- Diagnosis of second failure mode explaining low harness-benefit for weak-tier models
- Mechanistic explanation of why fine-tuning shifts persona vectors rather than directly learning narrow behaviors
- Demonstration that ignorance-driven novelty-seeking (not ambiguity avoidance) governs early exploration
- Justifies the choice of response tokens for persona vector extraction in the pipeline
- Empirical demonstration that a semantically meaningful variable is encoded as a curved manifold, and that respecting its geometry is critical for effective intervention.
- Demonstrates robustness of inference stages to non-fixed-point limiting behavior
- Positions the contribution relative to Angular Steering and Dynamic Steering literature