activity
20132023
most citedNeural Latents Benchmark '21: Evaluating latent variable models of neural population activity

44 citations · 199 across the 22 of their papers we have counts for

collaborators
Showing cs.LGShow all

12 papers · 1 filter

cs.LG2023

Half-Hop: A graph upsampling approach for slowing down message passing

Mehdi Azabou, Venkataramana Ganesh, Shantanu Thakoor +6

Message passing neural networks have shown a lot of success on graph-structured data. However, there are many instances where message passing can lead to over-smoothing or fail whe…

cs.LG2023★ 4 cited

Relax, it doesn't matter how you get there: A new self-supervised approach for multi-timescale behavior analysis

Mehdi Azabou, Michael Mendelson, Nauman Ahad +4

Natural behavior consists of dynamics that are complex and unpredictable, especially when trying to predict many steps into the future. While some success has been found in buildin…

cs.LG2022★ 18 cited

The good, the bad and the ugly sides of data augmentation: An implicit spectral regularization perspective

Chi-Heng Lin, Chiraag Kaushik, Eva L. Dyer +1

Data augmentation (DA) is a powerful workhorse for bolstering performance in modern machine learning. Specific augmentations like translations and scaling in computer vision are tr…

cs.LG2022★ 1 cited

Learning Behavior Representations Through Multi-Timescale Bootstrapping

Mehdi Azabou, Michael Mendelson, Maks Sorokin +4

Natural behavior consists of dynamics that are both unpredictable, can switch suddenly, and unfold over many different timescales. While some success has been found in building rep…

cs.LG2022★ 2 cited

Learning Sinkhorn divergences for supervised change point detection

Nauman Ahad, Eva L. Dyer, Keith B. Hengen +2

Many modern applications require detecting change points in complex sequential data. Most existing methods for change point detection are unsupervised and, as a consequence, lack a…

cs.LG2021★ 11 cited

Drop, Swap, and Generate: A Self-Supervised Approach for Generating Neural Activity

Ran Liu, Mehdi Azabou, Max Dabagia +5

Meaningful and simplified representations of neural activity can yield insights into how and what information is being processed within a neural circuit. However, without labels, f…

cs.LG2021★ 44 cited

Neural Latents Benchmark '21: Evaluating latent variable models of neural population activity

Felix Pei, Joel Ye, David Zoltowski +13

Advances in neural recording present increasing opportunities to study neural activity in unprecedented detail. Latent variable models (LVMs) are promising tools for analyzing this…

cs.LG2021★ 13 cited

Mine Your Own vieW: Self-Supervised Learning Through Across-Sample Prediction

Mehdi Azabou, Mohammad Gheshlaghi Azar, Ran Liu +10

State-of-the-art methods for self-supervised learning (SSL) build representations by maximizing the similarity between different transformed "views" of a sample. Without sufficient…

cs.LG2021★ 30 cited

Large-Scale Representation Learning on Graphs via Bootstrapping

Shantanu Thakoor, Corentin Tallec, Mohammad Gheshlaghi Azar +5

Self-supervised learning provides a promising path towards eliminating the need for costly label information in representation learning on graphs. However, to achieve state-of-the-…

cs.LG2020★ 4 cited

Making transport more robust and interpretable by moving data through a small number of anchor points

Chi-Heng Lin, Mehdi Azabou, Eva L. Dyer

Optimal transport (OT) is a widely used technique for distribution alignment, with applications throughout the machine learning, graphics, and vision communities. Without any addit…

cs.LG2020

Bayesian optimization for modular black-box systems with switching costs

Chi-Heng Lin, Joseph D. Miano, Eva L. Dyer

Most existing black-box optimization methods assume that all variables in the system being optimized have equal cost and can change freely at each iteration. However, in many real…

cs.LG2013

Greedy Feature Selection for Subspace Clustering

Eva L. Dyer, Aswin C. Sankaranarayanan, Richard G. Baraniuk

Unions of subspaces provide a powerful generalization to linear subspace models for collections of high-dimensional data. To learn a union of subspaces from a collection of data, s…