Metraipolis › archive › dc_d02f800e7d79
Learned Bow Control on a Measured Bowed-String Model: a Revised Minimum-Bow-Force Law, a Recurrent Controller, and the Domain of a Supervision Ceiling — arXiv:2609.14990
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.14990
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T00:15:41.110Z
- SHA-256 of the archived text
d075af0daf8ed79a7daa684004393e482df2921ef8081aaebc94c5b0ac5d1210- Stable URL of this page
https://metraipolis.com/documento/dc_d02f800e7d79
How to cite
Learned Bow Control on a Measured Bowed-String Model: a Revised Minimum-Bow-Force Law, a Recurrent Controller, and the Domain of a Supervision Ceiling — arXiv:2609.14990 — arXiv (en), https://arxiv.org/abs/2609.14990 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d02f800e7d79 (Metraipolis archive dc_d02f800e7d79, sha256 d075af0daf8ed79a7daa684004393e482df2921ef8081aaebc94c5b0ac5d1210)
BibTeX
@misc{dcd02f800e7d79,
title = {Learned Bow Control on a Measured Bowed-String Model: a Revised Minimum-Bow-Force Law, a Recurrent Controller, and the Domain of a Supervision Ceiling — arXiv:2609.14990},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.14990},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d02f800e7d79; sha256 d075af0daf8ed79a7daa684004393e482df2921ef8081aaebc94c5b0ac5d1210},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14990. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A finite-difference bowed-string model with implicitly resolved Stribeck friction is presented, with a regime diagnostic. Without implicit resolution no stick phase forms at any bow force. With friction, impedance and quality factor from published measurement rather than fitted, all four strings return a stick fraction of 89.1% against an ideal 90%. Schelleng's maximum bow force is recovered on every string. His minimum, $F_{\min} \propto Z^2 v_b \beta^{-2}$, is replaced by a law, $F_{\min} = C Z v_b / \beta$ with a dimensionless $C = 1.112 \pm 0.017$ that reproduces on sixty-four held-out operating points. Six controllers at matched capacity, on four strings at twenty seeds, place a gated recurrent network ahead of a feedforward one, its margin over the mean of the other five largest when the commanded bow speed is overridden at mid-stroke. The feedforward network completes more strokes, mostly from a cold start no player would use. A minimal gated variant fails because gates computed from the input alone cannot clear a latched state. Training loss selects neither the capacity nor the context length. No learned controller improves on the lookup rule that generated its labels where that rule is correct. Of the rule's 1089 cells, 57 are playable on a properly settled plant and unplayable by its labels, and the controller commands them where the lookup will not. The controller's score regresses on the rule's with a slope of 0.32, more than ten standard errors below unity, so it overtakes the rule where the rule fails and is bounded by it where it holds. Under a rigid finger stop the plant is provably invariant, so transfer loss between pitches is the controller's alone, traced to one feature. A regime classifier without a stick test mistakes small-amplitude periodic slipping for Helmholtz motion, and a harmonicity measure rates a string the bow never grips above it.
Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-15 in cs.LG).
Categorie arXiv: Audio and Speech Processing (eess.AS) ; Machine Learning (cs.LG); Sound (cs.SD); Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2609.14990 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T23:54:14.935Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).