Sample complexity of the Sign-Perturbed Sums method
Szentpéteri, Szabolcs and Csáji, Balázs Csanád (2025) Sample complexity of the Sign-Perturbed Sums method. AUTOMATICA, 178. ISSN 0005-1098 10.1016/j.automatica.2024.112020
|
Text
Szentpeteri_1_35645500_ny.pdf Download (817kB) | Preview |
Official URL: https://doi.org/10.1016/j.automatica.2024.112020
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Autonomous systems; |
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Divisions: | Research Laboratory on Engineering & Management Intelligence |
| SWORD Depositor: | MTMT Injector |
| Depositing User: | MTMT Injector |
| Date Deposited: | 26 Jun 2025 07:32 |
| Last Modified: | 26 Jun 2025 07:32 |
| URI: | https://eprints.sztaki.hu/id/eprint/10917 |
 |
Update Item |
