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

Carl Remlinger

dblp:261/2722 · DBLP profile ↗
← Back
2ranked-venue papers
1as 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 · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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
1 paper
Generative modeling · 87% Transfer learning and domain adaptation · 13%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%
Databases, data mining, and information retrieval
1 paper
Data integration and cleaning · 100%

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

TopicWeightPapersLastEvidence papers
Computational science and engineering
computational reproducibility
0.712023
Renku: a platform for sustainable data science · NeurIPS 2023
Machine learning › Generative modeling
generative adversarial network
0.612022
Conditional Loss and Deep Euler Scheme for Time Series Generation · AAAI 2022
Machine learning › Generative modeling › diffusion model
time series generation
0.612022
Conditional Loss and Deep Euler Scheme for Time Series Generation · AAAI 2022
Machine learning › Transfer learning and domain adaptation › few-shot learning
few-shot transfer
0.212022
Conditional Loss and Deep Euler Scheme for Time Series Generation · AAAI 2022

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

reproducibility · 1.3provenance tracking · 1.3wasserstein metric · 0.6euler discretization · 0.6GAN · 0.6
YearPublicationVenuePosition
2023 Renku: a platform for sustainable data science
abstract
Data and code working together is fundamental to machine learning (ML), but the context around datasets and interactions between datasets and code are in general captured only rudimentarily. Context such as how the dataset was prepared and created, what source data were used, what code was used in processing, how the dataset evolved, and where it has been used and reused can provide much insight, but this information is often poorly documented. That is unfortunate since it makes datasets into black-boxes with potentially hidden characteristics that have downstream consequences. We argue that making dataset preparation more accessible and dataset usage easier to record and document would have significant benefits for the ML community: it would allow for greater diversity in datasets by inviting modification to published sources, simplify use of alternative datasets and, in doing so, make results more transparent and robust, while allowing for all contributions to be adequately credited. We present a platform, Renku, designed to support and encourage such sustainable development and use of data, datasets, and code, and we demonstrate its benefits through a few illustrative projects which span the spectrum from dataset creation to dataset consumption and showcasing.
Rok Roskar, Chandrasekhar Ramakrishnan, Michele Volpi, Fernando Pérez-Cruz, Lilian Gasser, Firat Özdemir, Patrick Paitz, Mohammad Alisafaee, Philipp Fischer 0004, Ralf Grubenmann, Eliza J. Harris, Tasko Olevski, Carl Remlinger, Luis Salamanca, Elisabet Capon Garcia, Lorenzo Cavazzi, Jakub Chrobasik, Darlin Cordoba Osnas, Alessandro Degano, Jimena Dupre, Wesley Johnson, Eike Kettner, Laura Kinkead, Sean D. Murphy, Flora Thiebaut, Olivier Verscheure
NeurIPS13
2022 Conditional Loss and Deep Euler Scheme for Time Series Generation
abstract
We introduce three new generative models for time series that are based on Euler discretization of Stochastic Differential Equations (SDEs) and Wasserstein metrics. Two of these methods rely on the adaptation of generative adversarial networks (GANs) to time series. The third algorithm, called Conditional Euler Generator (CEGEN), minimizes a dedicated distance between the transition probability distributions over all time steps. In the context of Itô processes, we provide theoretical guarantees that minimizing this criterion implies accurate estimations of the drift and volatility parameters. Empirically, CEGEN outperforms state-of-the-art and GANs on both marginal and temporal dynamic metrics. Besides, correlation structures are accurately identified in high dimension. When few real data points are available, we verify the effectiveness of CEGEN when combined with transfer learning methods on model-based simulations. Finally, we illustrate the robustness of our methods on various real-world data sets.
Carl Remlinger, Joseph Mikael, Romuald Elie
AAAI1