Pawel M. Morkisz

dblp:173/3108 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
3since 2021 · last 2025
0000-0002-4734-966XORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 since 2021Theory of computation · 3 · 2 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1
YearPublicationVenuePosition
2025 A Framework for Large-Scale Synthetic Graph Dataset Generation
abstract
Recently, there has been increasing interest in developing and deploying deep graph learning algorithms for various tasks, such as fraud detection and recommender systems. However, there is a limited number of publicly available graph-structured datasets, most of which are small compared with production-sized applications or limited in their application domain. In this work, we tackle this shortcoming by proposing a synthetic graph generation tool that enables scaling datasets to production-size graphs with trillions of edges and billions of nodes. The proposed method comprises a series of parametric models that can either be randomly initialized or fit to proprietary datasets. These models can then be released to researchers to study graph methods on the synthetic data, facilitating prototype development and novel applications. We demonstrate the generalizability of the framework across various datasets, mimicking their structural and feature distributions, as well as the ability to scale them to varying sizes, demonstrating their usefulness for benchmarking and model development. Code can be found on GitHub.
Sajad Darabi, Piotr Bigaj, Dawid Majchrowski, Artur Kasymov, Pawel M. Morkisz, Alex Fit-Florea
IEEE Trans. Neural Networks Learn. Syst.5
2024 Efficient GPU implementation of randomized SVD and its applications
Lukasz Struski, Pawel M. Morkisz, Przemyslaw Spurek, Samuel Rodriguez Bernabeu, Tomasz Trzcinski
Expert Syst. Appl.2
2021 Randomized Runge-Kutta method - Stability and convergence under inexact information
Tomasz Bochacik, Maciej Gocwin, Pawel M. Morkisz, Pawel Przybylowicz
J. Complex.3
2020 Complexity of approximating Hölder classes from information with varying Gaussian noise
Pawel M. Morkisz, Leszek Plaskota
J. Complex.1
2019 Benchmarking Deep Learning for Time Series: Challenges and Directions
abstract
Deep learning for time series is an emerging area with close ties to industry, yet under represented in performance benchmarks for machine learning systems. In this paper, we present a landscape of deep learning applications applied to time series, and discuss the challenges and directions towards building a robust performance benchmark of deep learning workloads for time series data.
Geoffrey C. Fox, Sergey Serebryakov, Ankur Mohan, Pawel M. Morkisz, Debojyoti Dutta
IEEE BigData5
2016 Approximation of piecewise Hölder functions from inexact information
Pawel M. Morkisz, Leszek Plaskota
J. Complex.1