activity
20152022
most citedSelf-Expressive Decompositions for Matrix Approximation and Clustering

13 citations · 41 across the 5 of their papers we have counts for

collaborators

5 papers

cs.LG202111 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.LG2020

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…

stat.ML2019

Hierarchical Optimal Transport for Multimodal Distribution Alignment

John Lee, Max Dabagia, Eva L. Dyer +1

In many machine learning applications, it is necessary to meaningfully aggregate, through alignment, different but related datasets. Optimal transport (OT)-based approaches pose al…

stat.ML20158 cited

oASIS: Adaptive Column Sampling for Kernel Matrix Approximation

Raajen Patel, Thomas A. Goldstein, Eva L. Dyer +2

Kernel matrices (e.g. Gram or similarity matrices) are essential for many state-of-the-art approaches to classification, clustering, and dimensionality reduction. For large dataset…

cs.IT201513 cited

Self-Expressive Decompositions for Matrix Approximation and Clustering

Eva L. Dyer, Tom A. Goldstein, Raajen Patel +2

Data-aware methods for dimensionality reduction and matrix decomposition aim to find low-dimensional structure in a collection of data. Classical approaches discover such structure…