Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Artur Szumaczuk

dblp:293/5618 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2024
0000-0002-0329-5022ORCID · reported

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

Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Efficient and distributed learning · 42% Probabilistic and Bayesian machine learning · 21% Deep learning architectures and training · 18%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
inference acceleration
0.812024
SOI: Scaling Down Computational Complexity by Estimating Partial States of the Model · NeurIPS 2024
Machine learning › Efficient and distributed learning
model compression
0.812024
SOI: Scaling Down Computational Complexity by Estimating Partial States of the Model · NeurIPS 2024
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
online inference
0.812024
SOI: Scaling Down Computational Complexity by Estimating Partial States of the Model · NeurIPS 2024
Machine learning › Deep learning architectures and training
sequence modeling
0.712023
Short-Term Memory Convolutions · ICLR 2023
Natural language and speech › Speech recognition and synthesis › automatic speech recognition › real-time speech recognition
streaming speech recognition
0.712023
Short-Term Memory Convolutions · ICLR 2023
Embedded and real-time systems › embedded processor
microcontroller
0.212024
SOI: Scaling Down Computational Complexity by Estimating Partial States of the Model · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

scattered online inference · 1.5partial state estimation · 1.5convolutional neural network · 0.7attention · 0.7
YearPublicationVenuePosition
2024 SOI: Scaling Down Computational Complexity by Estimating Partial States of the Model
abstract
Consumer electronics used to follow the miniaturization trend described by Moore’s Law. Despite increased processing power in Microcontroller Units (MCUs), MCUs used in the smallest appliances are still not capable of running even moderately big, state-of-the-art artificial neural networks (ANNs) especially in time-sensitive scenarios. In this work, we present a novel method called Scattered Online Inference (SOI) that aims to reduce the computational complexity of ANNs. SOI leverages the continuity and seasonality of time-series data and model predictions, enabling extrapolation for processing speed improvements, particularly in deeper layers. By applying compression, SOI generates more general inner partial states of ANN, allowing skipping full model recalculation at each inference.
Grzegorz Stefanski, Pawel Daniluk, Artur Szumaczuk, Jakub Tkaczuk
NeurIPS3
2023 Short-Term Memory Convolutions
Grzegorz Stefanski, Krzysztof Arendt, Pawel Daniluk, Bartlomiej Jasik, Artur Szumaczuk
ICLR5
2021 The impact of data difficulty factors on classification of imbalanced and concept drifting data streams
abstract
Abstract Class imbalance introduces additional challenges when learning classifiers from concept drifting data streams. Most existing work focuses on designing new algorithms for dealing with the global imbalance ratio and does not consider other data complexities. Independent research on static imbalanced data has highlighted the influential role of local data difficulty factors such as minority class decomposition and presence of unsafe types of examples. Despite often being present in real-world data, the interactions between concept drifts and local data difficulty factors have not been investigated in concept drifting data streams yet. We thoroughly study the impact of such interactions on drifting imbalanced streams. For this purpose, we put forward a new categorization of concept drifts for class imbalanced problems. Through comprehensive experiments with synthetic and real data streams, we study the influence of concept drifts, global class imbalance, local data difficulty factors, and their combinations, on predictions of representative online classifiers. Experimental results reveal the high influence of new considered factors and their local drifts, as well as differences in existing classifiers’ reactions to such factors. Combinations of multiple factors are the most challenging for classifiers. Although existing classifiers are partially capable of coping with global class imbalance, new approaches are needed to address challenges posed by imbalanced data streams.
Dariusz Brzezinski, Leandro L. Minku, Tomasz Pewinski, Jerzy Stefanowski, Artur Szumaczuk
Knowl. Inf. Syst.5