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

Kristóf Szabó

dblp:279/1549 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 since 2021Systems, architecture and hardware · 1

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
Learning theory · 33% Learning paradigms · 33% Deep learning architectures and training · 33%
Network and information security
1 paper
Privacy and data protection · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
loss function design
0.812024
Towards Unbiased Exploration in Partial Label Learning · J. Mach. Learn. Res. 2024
Machine learning › Learning theory
online learning
0.812024
On the Growth of Mistakes in Differentially Private Online Learning: A Lower Bound Perspective · COLT 2024
Machine learning › Learning paradigms › weakly supervised learning
partial label learning
0.812024
Towards Unbiased Exploration in Partial Label Learning · J. Mach. Learn. Res. 2024
Privacy and data protection
differential privacy
0.812024
On the Growth of Mistakes in Differentially Private Online Learning: A Lower Bound Perspective · COLT 2024
Privacy and data protection › differential privacy
private online learning
0.812024
On the Growth of Mistakes in Differentially Private Online Learning: A Lower Bound Perspective · COLT 2024

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

lower bound analysis · 1.5softmax classifier · 0.8gradient descent · 0.8
YearPublicationVenuePosition
2024 On the Growth of Mistakes in Differentially Private Online Learning: A Lower Bound Perspective
abstract
In this paper, we provide lower bounds for Differentially Private (DP) Online Learning algorithms. Our result shows that, for a broad class of $(\epsilon,\delta)$-DP online algorithms, for number of rounds $T$ such that $\log T\leq O\left(1 / \delta\right)$, the expected number of mistakes incurred by the algorithm grows as \(\Omega\left(\log T\right)\). This matches the upper bound obtained by Golowich and Livni (2021) and is in contrast to non-private online learning where the number of mistakes is independent of \(T\). To the best of our knowledge, our work is the first result towards settling lower bounds for DP–Online learning and partially addresses the open question in Sanyal and Ramponi (2022).
Daniil Dmitriev, Kristóf Szabó, Amartya Sanyal
COLT2
2024 Towards Unbiased Exploration in Partial Label Learning
abstract
We consider learning a probabilistic classifier from partially-labelled supervision (inputs denoted with multiple possibilities) using standard neural architectures with a softmax as the final layer. We identify a bias phenomenon that can arise from the softmax layer in even simple architectures that prevents proper exploration of alternative options, making the dynamics of gradient descent overly sensitive to initialization. We introduce a novel loss function that allows for unbiased exploration within the space of alternative outputs. We give a theoretical justification for our loss function, and provide an extensive evaluation of its impact on synthetic data, on standard partially labelled benchmarks and on a contributed novel benchmark related to an existing rule learning challenge.
Zsolt Zombori, Agapi Rissaki, Kristóf Szabó, Wolfgang Gatterbauer, Michael Benedikt
J. Mach. Learn. Res.3
2020 Achieving Flexible Digital Production with the Arrowhead Workflow Choreographer
abstract
Arrowhead is an IIoT (Industrial IoT) framework that dynamically and flexibly supports automated manufacturing processes following Industry 4.0 expectations. This technical paper describes how its workflow management system, i.e., the Workflow Choreographer supports automated production. The motivation behind this work is to make production workflow management and execution more flexible by applying the SOA (Service-Oriented Architecture) principles that help information exchange between various, loosely coupled systems through late binding and lookup of their services. This paper further details the functions of the Workflow Choreographer system and shows how it applies the identified workflow levels in practice to provide a solution for the given challenge. To validate its feasibility, the paper presents simple use cases where the Workflow Choreographer manages typical production processes under laboratory conditions.
Dániel Kozma, Pál Varga, Kristóf Szabó
IECON3