Demo Data from EDBT 2026 / reviewers in the wild / expert
Igor Krawczuk
dblp:244/7380
· DBLP profile ↗
6ranked-venue papers
0as first author
5since 2021 · last 2024
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 5 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
4 papers |
Generative modeling · 29% Reinforcement learning · 24% Trustworthy machine learning · 19% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 13 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling
diffusion model |
1.4 | 2 | 2024 | Going beyond Compositions, DDPMs Can Produce Zero-Shot Interpolations · ICML 2024 DiGress: Discrete Denoising diffusion for graph generation · ICLR 2023 |
Machine learning › Representation and self-supervised learning › latent space › latent space manipulation
latent space interpolation |
0.8 | 1 | 2024 | Going beyond Compositions, DDPMs Can Produce Zero-Shot Interpolations · ICML 2024 |
Machine learning › Trustworthy machine learning › robustness
adversarial robustness |
0.7 | 1 | 2023 | Finding Actual Descent Directions for Adversarial Training · ICLR 2023 |
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
adversarial training |
0.7 | 1 | 2023 | Finding Actual Descent Directions for Adversarial Training · ICLR 2023 |
Machine learning › Generative modeling › diffusion model › graph diffusion model
diffusion-based graph generation |
0.7 | 1 | 2023 | DiGress: Discrete Denoising diffusion for graph generation · ICLR 2023 |
Distributed systems › distributed optimization
communication-efficient distributed optimization |
0.7 | 1 | 2023 | Distributed Extra-gradient with Optimal Complexity and Communication Guarantees · ICLR 2023 |
Distributed systems
distributed optimization |
0.7 | 1 | 2023 | Distributed Extra-gradient with Optimal Complexity and Communication Guarantees · ICLR 2023 |
Mathematical optimization
continuous optimization |
0.7 | 1 | 2023 | Distributed Extra-gradient with Optimal Complexity and Communication Guarantees · ICLR 2023 |
Mathematical optimization › continuous optimization › convex optimization › first-order methods
extragradient method |
0.7 | 1 | 2023 | Distributed Extra-gradient with Optimal Complexity and Communication Guarantees · ICLR 2023 |
Machine learning › Reinforcement learning
imitation learning |
0.6 | 1 | 2022 | Proximal Point Imitation Learning · NeurIPS 2022 |
Machine learning › Reinforcement learning › imitation learning
inverse reinforcement learning |
0.6 | 1 | 2022 | Proximal Point Imitation Learning · NeurIPS 2022 |
Machine learning › Reinforcement learning › imitation learning
offline imitation learning |
0.6 | 1 | 2022 | Proximal Point Imitation Learning · NeurIPS 2022 |
Machine learning › Optimization for machine learning › proximal methods
proximal point method |
0.6 | 1 | 2022 | Proximal Point Imitation Learning · NeurIPS 2022 |
Methods — techniques the papers use, named apart from their topics
variance reduction · 1.3extragradient · 0.7extra-gradient · 0.7discrete denoising diffusion · 0.7proximal point method · 0.6minimax optimization · 0.6linear function approximation · 0.6dual smoothing · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Going beyond Compositions, DDPMs Can Produce Zero-Shot InterpolationsabstractDenoising Diffusion Probabilistic Models (DDPMs) exhibit remarkable capabilities in image generation, with studies suggesting that they can generalize by composing latent factors learned from the training data. In this work, we go further and study DDPMs trained on strictly separate subsets of the data distribution with large gaps on the support of the latent factors. We show that such a model can effectively generate images in the unexplored, intermediate regions of the distribution. For instance, when trained on clearly smiling and non-smiling faces, we demonstrate a sampling procedure which can generate slightly smiling faces without reference images (zero-shot interpolation). We replicate these findings for other attributes as well as other datasets. [Our code is available on GitHub](https://github.com/jdeschena/ddpm-zero-shot-interpolation). Justin Deschenaux, Igor Krawczuk, Grigorios Chrysos 0002, Volkan Cevher |
ICML | 2 |
| 2023 | Finding Actual Descent Directions for Adversarial Training
Fabian Latorre, Igor Krawczuk, Leello Tadesse Dadi, Thomas Pethick, Volkan Cevher |
ICLR | 2 |
| 2023 | Distributed Extra-gradient with Optimal Complexity and Communication Guarantees
Ali Ramezani-Kebrya, Kimon Antonakopoulos, Igor Krawczuk, Justin Deschenaux, Volkan Cevher |
ICLR | 3 |
| 2023 | DiGress: Discrete Denoising diffusion for graph generation
Clément Vignac, Igor Krawczuk, Antoine Siraudin, Volkan Cevher, Pascal Frossard |
ICLR | 2 |
| 2022 | Proximal Point Imitation LearningabstractThis work develops new algorithms with rigorous efficiency guarantees for infinite horizon imitation learning (IL) with linear function approximation without restrictive coherence assumptions. We begin with the minimax formulation of the problem and then outline how to leverage classical tools from optimization, in particular, the proximal-point method (PPM) and dual smoothing, for online and offline IL, respectively. Thanks to PPM, we avoid nested policy evaluation and cost updates for online IL appearing in the prior literature. In particular, we do away with the conventional alternating updates by the optimization of a single convex and smooth objective over both cost and $Q$-functions. When solved inexactly, we relate the optimization errors to the suboptimality of the recovered policy. As an added bonus, by re-interpreting PPM as dual smoothing with the expert policy as a center point, we also obtain an offline IL algorithm enjoying theoretical guarantees in terms of required expert trajectories. Finally, we achieve convincing empirical performance for both linear and neural network function approximation. Luca Viano, Angeliki Kamoutsi, Gergely Neu, Igor Krawczuk, Volkan Cevher |
NeurIPS | 4 |
| 2019 | Multi-ReRAM Synapses for Artificial Neural Network TrainingabstractMetal-oxide-based resistive memory devices (ReRAM) are being actively researched as synaptic elements of neuromorphic co-processors for training deep neural networks (DNNs). However, device-level non-idealities are posing significant challenges. In this work we present a multi-ReRAM-based synaptic architecture with a counter-based arbitration scheme that shows significant promise. We present a 32×2 crossbar array comprising Pt/HfO2/Ti/TiN-based ReRAM devices with multi-level storage capability and bidirectional conductance response. We study the device characteristics in detail and model the conductance response. We show through simulations that an in-situ trained DNN with a multi-ReRAM synaptic architecture can perform handwritten digit classification task with high accuracies, only 2% lower than software simulations using floating point precision, despite the stochasticity, nonlinearity and large conductance change granularity associated with the devices. Moreover, we show that a network can achieve accuracies > 80% even with just binary ReRAM devices with this architecture. Irem Boybat, Cecilia Giovinazzo, Elmira Shahrabi, Igor Krawczuk, Iason Giannopoulos, Christophe Piveteau, Manuel Le Gallo, Carlo Ricciardi, Abu Sebastian, Evangelos Eleftheriou, Yusuf Leblebici |
ISCAS | 4 |