Demo Data from VLDB 2026 / reviewers in the wild / expert
André Gaillard
dblp:300/3890
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2023
—ORCID · none
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 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.
| Computer graphics and multimedia
1 paper |
Image and video processing · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 44% High-performance computing · 44% Performance modeling and evaluation · 13% | |
| Artificial intelligence
1 paper |
Deep learning architectures and training · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training
activation function |
0.7 | 1 | 2023 | Empowering Convolutional Neural Nets with MetaSin Activation · NeurIPS 2023 |
Image and video processing › image restoration
denoising |
0.7 | 1 | 2023 | Empowering Convolutional Neural Nets with MetaSin Activation · NeurIPS 2023 |
Image and video processing
image resampling |
0.7 | 1 | 2023 | Empowering Convolutional Neural Nets with MetaSin Activation · NeurIPS 2023 |
Image and video processing
image restoration |
0.7 | 1 | 2023 | Empowering Convolutional Neural Nets with MetaSin Activation · NeurIPS 2023 |
Distributed systems › communication optimization
communication-optimal algorithms |
0.5 | 1 | 2021 | On the parallel I/O optimality of linear algebra kernels: near-optimal matrix factorizations · SC 2021 |
High-performance computing › numerical linear algebra
matrix factorization |
0.5 | 1 | 2021 | On the parallel I/O optimality of linear algebra kernels: near-optimal matrix factorizations · SC 2021 |
Methods — techniques the papers use, named apart from their topics
metasin activation · 1.3knowledge distillation · 1.3i/o lower bound analysis · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Empowering Convolutional Neural Nets with MetaSin ActivationabstractReLU networks have remained the default choice for models in the area of image prediction despite their well-established spectral bias towards learning low frequencies faster, and consequently their difficulty of reproducing high frequency visual details. As an alternative, sin networks showed promising results in learning implicit representations of visual data. However training these networks in practically relevant settings proved to be difficult, requiring careful initialization, dealing with issues due to inconsistent gradients, and a degeneracy in local minima. In this work, we instead propose replacing a baseline network’s existing activations with a novel ensemble function with trainable parameters. The proposed MetaSin activation can be trained reliably without requiring intricate initialization schemes, and results in consistently lower test loss compared to alternatives. We demonstrate our method in the areas of Monte-Carlo denoising and image resampling where we set new state-of-the-art through a knowledge distillation based training procedure. We present ablations on hyper-parameter settings, comparisons with alternative activation function formulations, and discuss the use of our method in other domains, such as image classification. Farnood Salehi, Tunç Ozan Aydin, André Gaillard, Guglielmo Camporese |
NeurIPS | 3 |
| 2021 | On the parallel I/O optimality of linear algebra kernels: near-optimal matrix factorizations
Grzegorz Kwasniewski, Marko Kabic, Tal Ben-Nun, Alexandros Nikolaos Ziogas, Jens Eirik Saethre, André Gaillard, Timo Schneider, Maciej Besta, Anton Kozhevnikov, Joost VandeVondele, Torsten Hoefler |
SC | 6 |