← Search

Ya-Wei Eileen Lin

10 accepted papers

2026

Beyond Structural Symmetries: Linear Mode Connectivity via Neuron Identifiability

ICML 2026poster

Many striking phenomena in deep learning, such as linear mode connectivity and the structured behavior of training dynamics, are closely tied to parameter symmetries: transformations that leave the realized function unchanged. Despite growing attention to structural parameter symmetries, the exact i…

Cited by 0SourceScholar
2025

Finsler Multi-Dimensional Scaling: Manifold Learning for Asymmetric Dimensionality Reduction and Embedding

CVPR 2025poster

Dimensionality reduction is a fundamental task that aims to simplify complex data by reducing its feature dimensionality while preserving essential patterns, with core applications in data analysis and visualisation. To preserve the underlying data structure, multi-dimensional scaling (MDS) methods…

2025

Hyperbolic Distance Based on EMD and Diffusion for Hyperspectral Imaging

ICASSP 2025accepted

In this paper, we introduce EMD-Based Hyperbolic Diffusion Distance (EMD-HDD), a new method for constructing a meaningful distance metric for hierarchical data with latent hierarchical structure. Our method relies on hyperbolic geometry, diffusion geometry, and the Earth Mover’s Distance (EMD). Spec…

Cited by 0SourceScholar
2025

Joint Hierarchical Representation Learning of Samples and Features via Informed Tree-Wasserstein Distance

NeurIPS 2025spotlight

High-dimensional data often exhibit hierarchical structures in both modes: samples and features. Yet, most existing approaches for hierarchical representation learning consider only one mode at a time. In this work, we propose an unsupervised method for jointly learning hierarchical representations…

Cited by 0SourceScholar
2025

Tree-Wasserstein Distance for High Dimensional Data with a Latent Feature Hierarchy

ICLR 2025poster

Finding meaningful distances between high-dimensional data samples is an important scientific task. To this end, we propose a new tree-Wasserstein distance (TWD) for high-dimensional data with two key aspects. First, our TWD is specifically designed for data with a latent feature hierarchy, i.e., th…

Cited by 4SourcePDFScholar
2024

Equivariant Machine Learning on Graphs with Nonlinear Spectral Filters

NeurIPS 2024poster

Equivariant machine learning is an approach for designing deep learning models that respect the symmetries of the problem, with the aim of reducing model complexity and improving generalization. In this paper, we focus on an extension of shift equivariance, which is the basis of convolution network…

Cited by 0SourcePDFScholar
2024

Hyperbolic Diffusion Procrustes Analysis for Intrinsic Representation of Hierarchical Data Sets

ICASSP 2024accepted

In this paper, we present Hyperbolic Diffusion Procrustes Analysis (HDPA), a new method for informative representation of hierarchical datasets based on hyperbolic geometry, diffusion geometry, and Procrustes analysis. Our method jointly embeds multiple datasets in a product manifold of hyperbolic s…

Cited by 0SourceScholar
2023

Hyperbolic Diffusion Embedding and Distance for Hierarchical Representation Learning

ICML 2023poster

Finding meaningful representations and distances of hierarchical data is important in many fields. This paper presents a new method for hierarchical data embedding and distance. Our method relies on combining diffusion geometry, a central approach to manifold learning, and hyperbolic geometry. Speci…