EDBT 2026 Demo / reviewers in the wild / expert
Krzysztof Jankowski
dblp:45/9122
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author
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
1 paper |
Reinforcement learning · 100% | |
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Processor architecture and microarchitecture · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
continuous control |
0.8 | 1 | 2024 | Bigger, Regularized, Optimistic: scaling for compute and sample efficient continuous control · NeurIPS 2024 |
Machine learning › Reinforcement learning › sample efficiency
sample-efficient reinforcement learning |
0.8 | 1 | 2024 | Bigger, Regularized, Optimistic: scaling for compute and sample efficient continuous control · NeurIPS 2024 |
Machine learning › Reinforcement learning
value function approximation |
0.8 | 1 | 2024 | Bigger, Regularized, Optimistic: scaling for compute and sample efficient continuous control · NeurIPS 2024 |
Machine learning › Reinforcement learning › exploration
optimistic exploration |
0.2 | 1 | 2024 | Bigger, Regularized, Optimistic: scaling for compute and sample efficient continuous control · NeurIPS 2024 |
Cryptographic primitives and cryptanalysis › authenticated encryption
AES-GCM |
0.1 | 1 | 2011 | Packed AES-GCM Algorithm Suitable for AES/PCLMULQDQ Instructions · IEEE Trans. Computers 2011 |
Cryptographic primitives and cryptanalysis
authenticated encryption |
0.1 | 1 | 2011 | Packed AES-GCM Algorithm Suitable for AES/PCLMULQDQ Instructions · IEEE Trans. Computers 2011 |
Processor architecture and microarchitecture › instruction set architecture
instruction set extension |
0.1 | 1 | 2011 | Packed AES-GCM Algorithm Suitable for AES/PCLMULQDQ Instructions · IEEE Trans. Computers 2011 |
Cryptographic primitives and cryptanalysis › authenticated encryption
GHASH |
0.0 | 1 | 2011 | Packed AES-GCM Algorithm Suitable for AES/PCLMULQDQ Instructions · IEEE Trans. Computers 2011 |
Methods — techniques the papers use, named apart from their topics
regularization · 0.8optimistic exploration · 0.8parallel multiplier · 0.2packed AES-GCM · 0.2modular reduction · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Bigger, Regularized, Optimistic: scaling for compute and sample efficient continuous controlabstractSample efficiency in Reinforcement Learning (RL) has traditionally been driven by algorithmic enhancements. In this work, we demonstrate that scaling can also lead to substantial improvements. We conduct a thorough investigation into the interplay of scaling model capacity and domain-specific RL enhancements. These empirical findings inform the design choices underlying our proposed BRO (Bigger, Regularized, Optimistic) algorithm. The key innovation behind BRO is that strong regularization allows for effective scaling of the critic networks, which, paired with optimistic exploration, leads to superior performance. BRO achieves state-of-the-art results, significantly outperforming the leading model-based and model-free algorithms across 40 complex tasks from the DeepMind Control, MetaWorld, and MyoSuite benchmarks. BRO is the first model-free algorithm to achieve near-optimal policies in the notoriously challenging Dog and Humanoid tasks. Michal Nauman, Mateusz Ostaszewski, Krzysztof Jankowski, Piotr Milos, Marek Cygan |
NeurIPS | 3 |
| 2011 | Packed AES-GCM Algorithm Suitable for AES/PCLMULQDQ InstructionsabstractThe level of interest in Galois Counter Mode (GCM) Authenticated Encryption rose significantly within the last few years. GCM is interesting because it is the only authenticated encryption standard that can be implemented in a fully pipelined or parallelized way and it is the most appropriate for encrypting packetized data. McGrew and Viega [CHECK END OF SENTENCE] described (but did not detail) how GHASH can be implemented with more than one multiplier operating in parallel. This paper details how that can be done and shows that, when N multipliers are used, and the multipliers use the approach of multiplying polynomials then applying a modular reduction, a single modular reduction can be used instead on N separate operations. This optimization can be used even when there is a single multiplier, which makes this implementation strategy have a broader appeal. Recently Intel has introduced new ISA instructions into the next generation CPU core, namely: AES family and PCLMULQDQ operating in XMM registers domain. In this paper, we discuss the example implementation of proposed GHASH modifications using above instructions. Krzysztof Jankowski, Pierre Laurent |
IEEE Trans. Computers | 1 |