Leszek Plaskota

Publication Activity (10 Years)

Years Active: 1989-2023
Publications (10 Years): 12

Top Topics

Variance Reduction

Top Venues

J. Approx. Theory

Numerische Mathematik

Publications

Leszek Plaskota, Pawel Siedlecki
Worst case tractability of linear problems in the presence of noise: linear information. CoRR (2023)
Leszek Plaskota, Pawel Siedlecki
Worst case tractability of linear problems in the presence of noise: Linear information. J. Complex. 79 (2023)
Leszek Plaskota, Pawel Przybylowicz, Lukasz T. Stepien
Monte Carlo integration with adaptive variance reduction: an asymptotic analysis. CoRR (2022)
Leszek Plaskota, Pawel Samoraj
Automatic approximation using asymptotically optimal adaptive interpolation. Numer. Algorithms 89 (1) (2022)
Leszek Plaskota, Pawel Siedlecki, Henryk Wozniakowski
Absolute value information for IBC problems. J. Complex. 56 (2020)
Pawel M. Morkisz, Leszek Plaskota
Complexity of approximating Hölder classes from information with varying Gaussian noise. J. Complex. 60 (2020)
Peter Kritzer, Friedrich Pillichshammer, Leszek Plaskota, Grzegorz W. Wasilkowski
On efficient weighted integration via a change of variables. Numerische Mathematik 146 (3) (2020)
Peter Kritzer, Friedrich Pillichshammer, Leszek Plaskota, Grzegorz W. Wasilkowski
On alternative quantization for doubly weighted approximation and integration over unbounded domains. J. Approx. Theory 256 (2020)
Peter Kritzer, Friedrich Pillichshammer, Leszek Plaskota, Grzegorz W. Wasilkowski
On alternative quantization for doubly weighted approximation and integration over unbounded domains. CoRR (2019)
Frances Y. Kuo, Dirk Nuyens, Leszek Plaskota, Ian H. Sloan, Grzegorz W. Wasilkowski
Infinite-dimensional integration and the multivariate decomposition method. J. Comput. Appl. Math. 326 (2017)
Pawel M. Morkisz, Leszek Plaskota
Approximation of piecewise Hölder functions from inexact information. J. Complex. 32 (1) (2016)
Frances Y. Kuo, Leszek Plaskota, Grzegorz W. Wasilkowski
Optimal algorithms for doubly weighted approximation of univariate functions. J. Approx. Theory 201 (2016)
Leszek Plaskota
Automatic integration using asymptotically optimal adaptive Simpson quadrature. Numerische Mathematik 131 (1) (2015)
Leszek Plaskota
Continuous Problems: Optimality, Complexity, Tractability (Invited Talk). CASC (2014)
Leszek Plaskota, Grzegorz W. Wasilkowski
Efficient algorithms for multivariate and ∞-variate integration with exponential weight. Numer. Algorithms 67 (2) (2014)
Leszek Plaskota, Grzegorz W. Wasilkowski, Yaxi Zhao
An Adaptive Algorithm for Weighted Approximation of Singular Functions over R. SIAM J. Numer. Anal. 51 (3) (2013)
Mark A. Kon, Leszek Plaskota
On Some Integrated Approaches to Inference CoRR (2012)
Leszek Plaskota, Grzegorz W. Wasilkowski
Tractability of infinite-dimensional integration in the worst case and randomized settings. J. Complex. 27 (6) (2011)
Thomas Müller-Gronbach, Leszek Plaskota, Wolfgang Ch. Schmid
Guest Editors' Preface. J. Complex. 27 (3-4) (2011)
Thomas Müller-Gronbach, Leszek Plaskota, Joseph F. Traub
09391 Abstracts Collection - Algorithms and Complexity for Continuous Problems. Algorithms and Complexity for Continuous Problems (2009)
Leszek Plaskota, Grzegorz W. Wasilkowski, Yaxi Zhao
New averaging technique for approximating weighted integrals. J. Complex. 25 (3) (2009)
Leszek Plaskota, Grzegorz W. Wasilkowski, Yaxi Zhao
The power of adaption for approximating functions with singularities. Math. Comput. 77 (264) (2008)
Leszek Plaskota, Grzegorz W. Wasilkowski
Uniform Approximation of Piecewise r-Smooth and Globally Continuous Functions. SIAM J. Numer. Anal. 47 (1) (2008)
Boleslaw Z. Kacewicz, Leszek Plaskota, Grzegorz W. Wasilkowski
Issue dedicated to Professor Henryk Wozniakowski. J. Complex. 23 (4-6) (2007)
Leszek Plaskota, Ian H. Sloan
Guest Editors' preface. J. Complex. 22 (5) (2006)
Mark A. Kon, Leszek Plaskota
Information-based nonlinear approximation: an average case setting. J. Complex. 21 (2) (2005)
Mark A. Kon, Leszek Plaskota, Andrzej W. Przybyszewski
Machine Learning and Statistical MAP Methods. Intelligent Information Systems (2005)
Leszek Plaskota, Grzegorz W. Wasilkowski
Adaption allows efficient integration of functions with unknown singularities. Numerische Mathematik 102 (1) (2005)
Mark A. Kon, Leszek Plaskota, Andrzej W. Przybyszewski
Statistical Likelihood Representations of Prior Knowledge in Machine Learning. Artificial Intelligence and Applications (2005)
Leszek Plaskota
Information-Based Nonlinear Approximation: An Average Case Setting. Algorithms and Complexity for Continuous Problems (2004)
Leszek Plaskota, Klaus Ritter, Grzegorz W. Wasilkowski
Optimal designs for weighted approximation and integration of stochastic processes on [0, infinity). J. Complex. 20 (1) (2004)
Piotr Gajda, Youming Li, Leszek Plaskota, Grzegorz W. Wasilkowski
. Math. Comput. 73 (246) (2004)
Leszek Plaskota, Grzegorz W. Wasilkowski
-Approximation of Multivariate Functions with Bounded Mixed Derivatives of Second Order. Numer. Algorithms 36 (3) (2004)
Leszek Plaskota, Klaus Ritter
Guest Editors' Preface. J. Complex. 20 (5) (2004)
Leszek Plaskota, Klaus Ritter, Grzegorz W. Wasilkowski
. J. Complex. 18 (2) (2002)
Mark A. Kon, Leszek Plaskota
Complexity of Neural Network Approximation with Limited Information: A Worst Case Approach. J. Complex. 17 (2) (2001)
Leszek Plaskota, Grzegorz W. Wasilkowski
The Exact Exponent of Sparse Grid Quadratures in the Weighted Case. J. Complex. 17 (4) (2001)
Mark A. Kon, Leszek Plaskota
Information complexity of neural networks. Neural Networks 13 (3) (2000)
Leszek Plaskota
The exponent of discrepancy of sparse grids is at least 2.1933. Adv. Comput. Math. 12 (1) (2000)
Leszek Plaskota
Worst Case Complexity of Problems with Random Information Noise. J. Complex. 12 (4) (1996)
Leszek Plaskota
How to Benefit from Noise. J. Complex. 12 (2) (1996)
Leszek Plaskota
Average Complexity for Linear Problems in a Model with Varying Information Noise. J. Complex. 11 (2) (1995)
Leszek Plaskota
A Note on Varying Cardinality in the Average Case Setting. J. Complex. 9 (4) (1993)
Boleslaw Z. Kacewicz, Leszek Plaskota
The Minimal Cost of Approximating Linear Operators Using Perturbed Information-The Asymptotic Setting. J. Complex. 9 (1) (1993)
Leszek Plaskota
Function approximation and integration on the wiener space with noisy data. J. Complex. 8 (3) (1992)
Boleslaw Z. Kacewicz, Leszek Plaskota
Noisy information for linear problems in the asymptotic setting. J. Complex. 7 (1) (1991)
Leszek Plaskota
On average case complexity of linear problems with noisy information. J. Complex. 6 (2) (1990)
Leszek Plaskota
Asymptotic error for the global maximum of functions in s dimensions. J. Complex. 5 (3) (1989)