most citedProvably expressive temporal graph networks

16 citations · 16 across the 3 of their papers we have counts for

collaborators
Showing cs.LGShow all

6 papers · 1 filter

cs.LG2026

Decafs: Disentangled Conditional adversarial Flows

Anirudh jain, Sakshi Varshney, Samuel Kaski +1

Flow-based models have established state-of-the-art performance in generative modeling across domains, but are hard to interpret due to their complex latent embeddings. In particul…

cs.LG20232 cited

AbODE: Ab Initio Antibody Design using Conjoined ODEs

Yogesh Verma, Markus Heinonen, Vikas Garg

Antibodies are Y-shaped proteins that neutralize pathogens and constitute the core of our adaptive immune system. De novo generation of new antibodies that target specific antigens…

cs.LG2022

Modular Flows: Differential Molecular Generation

Yogesh Verma, Samuel Kaski, Markus Heinonen +1

Generating new molecules is fundamental to advancing critical applications such as drug discovery and material synthesis. Flows can generate molecules effectively by inverting the…

cs.LG202216 cited

Provably expressive temporal graph networks

Amauri H. Souza, Diego Mesquita, Samuel Kaski +1

Temporal graph networks (TGNs) have gained prominence as models for embedding dynamic interactions, but little is known about their theoretical underpinnings. We establish fundamen…

cs.LG2022

Why GANs are overkill for NLP

David Alvarez-Melis, Vikas Garg, Adam Tauman Kalai

This work offers a novel theoretical perspective on why, despite numerous attempts, adversarial approaches to generative modeling (e.g., GANs) have not been as popular for certain…

cs.LG2018

Online Markov Decoding: Lower Bounds and Near-Optimal Approximation Algorithms

Vikas K. Garg, Tamar Pichkhadze

We resolve the fundamental problem of online decoding with general order ergodic Markov chain models. Specifically, we provide deterministic and randomized algorithms whos…