3 citations · 5 across the 2 of their papers we have counts for
3 papers · 1 filter
Sample Complexity of the Sign-Perturbed Sums Identification Method: Scalar Case
Szabolcs Szentpéteri, Balázs Csanád Csáji
Sign-Perturbed Sum (SPS) is a powerful finite-sample system identification algorithm which can construct confidence regions for the true data generating system with exact coverage…
Improving Kernel-Based Nonasymptotic Simultaneous Confidence Bands
Balázs Csanád Csáji, Bálint Horváth
The paper studies the problem of constructing nonparametric simultaneous confidence bands with nonasymptotic and distribition-free guarantees. The target function is assumed to be…
On Rate-Optimal Partitioning Classification from Observable and from Privatised Data
Balázs Csanád Csáji, László Györfi, Ambrus Tamás +1
In this paper we revisit the classical method of partitioning classification and prove novel convergence rates under relaxed conditions, both for observable (non-privatised) and fo…