no code implementations • 22 Dec 2023 • Balázs Csanád Csáji, László Györfi, Ambrus Tamás, Harro Walk
Here, we study the problem under much milder assumptions: in addition to the standard Lipschitz and margin conditions, a novel characteristic of the absolutely continuous component is introduced, by which the exact convergence rate of the classification error probability is calculated, both for the binary and for the multi-label cases.
no code implementations • 3 Aug 2023 • Ambrus Tamás, Balázs Csanád Csáji
One of the key objects of binary classification is the regression function, i. e., the conditional expectation of the class labels given the inputs.
no code implementations • 3 Aug 2023 • Ambrus Tamás, Dániel Ágoston Bálint, Balázs Csanád Csáji
The paper introduces robust independence tests with non-asymptotically guaranteed significance levels for stochastic linear time-invariant systems, assuming that the observed outputs are synchronous, which means that the systems are driven by jointly i. i. d.
no code implementations • 12 Feb 2023 • Ambrus Tamás, Balázs Csanád Csáji
In this paper we present a new recursive algorithm to estimate the conditional kernel mean map in a Hilbert space valued $L_2$ space, that is in a Bochner space.
no code implementations • 8 Mar 2021 • Ambrus Tamás, Balázs Csanád Csáji
In this paper we suggest two statistical hypothesis tests for the regression function of binary classification based on conditional kernel mean embeddings.
no code implementations • 23 Mar 2019 • Balázs Csanád Csáji, Ambrus Tamás
The paper studies binary classification and aims at estimating the underlying regression function which is the conditional expectation of the class labels given the inputs.