52 citations · 75 across the 17 of their papers we have counts for
20 papers
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…
Distribution-free tests for lossless feature selection in classification and regression
László Györfi, Tamás Linder, Harro Walk
We study the problem of lossless feature selection for a -dimensional feature vector and label for binary classification as well as nonparametri…
Repeated Observations for Classification
Hüseyin Afşer, László Györfi, Harro Walk
We study the problem nonparametric classification with repeated observations. Let $\bX$ be the dimensional feature vector and let denote the label taking values in $\{1,\do…
Lossless Transformations and Excess Risk Bounds in Statistical Inference
László Györfi, Tamás Linder, Harro Walk
We study the excess minimum risk in statistical inference, defined as the difference between the minimum expected loss in estimating a random variable from an observed feature vect…
On the strong stability of ergodic iterations
László Györfi, Attila Lovas, Miklós Rásonyi
We revisit processes generated by iterated random functions driven by a stationary and ergodic sequence. Such a process is called strongly stable if a random initialization exists,…
Tree density estimation
László Györfi, Aryeh Kontorovich, Roi Weiss
We study the problem of estimating the density of a random vector in . For a spanning tree defined on the vertex set $\{1,\dot…