Adam Krzyzak

Prof. Adam Krzyzak

Department of Computer Science and Software Engineering, Concordia University, Montreal H3G 1M8, Canada

Research Focus & Metrics

Academic Career Length

36Years (1991-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2016 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
MKMichael Kohler
Michael Kohler
Adam KrzyzakAdam Krzyzak
Adam Krzyzak
In this paper, we introduce the so-called hierarchical interaction models, where we assume that the computation of the value of a function m : ℝ d → ℝ is done in several layers, where in each layer a function of at most d* inputs computed by the previous layer is evaluated. We investigate two different regression estimates based on polynomial splines and on neural networks, and show that if the regression function satisfies a hierarchical interaction model and all occurring functions in the model are smooth, the rate of convergence of these estimates depends on d* (and not on d). Hence, in this case, the estimates can achieve good rate of convergence even for large d, and are in this sense able to circumvent the so-called curse of dimensionality.

26 February 2005 in Integrated Computer-Aided Engineering
Verified
Journal Article
Closed access
PDF file
GCG.Y. Chen
G.Y. Chen
TBT.D. Bui
T.D. Bui
Adam KrzyzakAdam Krzyzak
Adam Krzyzak
The denoising of a natural image corrupted by Gaussian noise is a classical problem in signal or image processing. Donoho and his coworkers at Stanford pioneered a wavelet denoising scheme by thresholding the wavelet coefficients arising from the sta


26 January 2022 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
MKMichael Kohler
Michael Kohler
Adam KrzyzakAdam Krzyzak
Adam Krzyzak
SLSophie Langer
Sophie Langer
Deep neural networks (DNNs) achieve impressive results for complicated tasks like object detection on images and speech recognition. Motivated by this practical success, there is now a strong interest in showing good theoretical properties of DNNs. To describe for which tasks DNNs perform well and when they fail, it is a key challenge to understand their performance. The aim of this paper is to contribute to the current statistical theory of DNNs. We apply DNNs on high dimensional data and we show that the least squares regression estimates using DNNs are able to achieve dimensionality reduction in case that the regression function has locally low dimensionality. Consequently, the rate of convergence of the estimate does not depend on its input dimension $d$ , but on its local dimension $d^{*}$ and the DNNs are able to circumvent the curse of dimensionality in case that $d^{*}$ is much smaller than $d$ . In our simulation study we provide numerical experiments to support our theoretical result and we compare our estimate with other conventional nonparametric regression estimates. The performance of our estimates is also validated in experiments with real data.

11 May 2006 in Pattern Analysis and Applications
Verified
Journal Article
Closed access
PDF file
GCG. Y. Chen
G. Y. Chen
TBT. D. Bui
T. D. Bui
Adam KrzyzakAdam Krzyzak
Adam Krzyzak

25 January 2023 in Computers in Biology and Medicine
Verified
Journal Article
Closed access
MSMohammad Amin Shamshiri
Mohammad Amin Shamshiri
Adam KrzyzakAdam Krzyzak
Adam Krzyzak
MKMarek Kowal
Marek Kowal
JKJózef Korbicz
Józef Korbicz