Search Results for author: Yimeng Min

Found 10 papers, 5 papers with code

On Size and Hardness Generalization in Unsupervised Learning for the Travelling Salesman Problem

no code implementations29 Mar 2024 Yimeng Min, Carla P. Gomes

Our investigation explores how different training instance sizes, embedding dimensions, and distributions influence the outcomes of Unsupervised Learning methods.

Unsupervised Learning for Solving the Travelling Salesman Problem

1 code implementation NeurIPS 2023 Yimeng Min, Yiwei Bai, Carla P. Gomes

Our loss function consists of two parts: one pushes the model to find the shortest path and the other serves as a surrogate for the constraint that the route should form a Hamiltonian Cycle.

Can Hybrid Geometric Scattering Networks Help Solve the Maximum Clique Problem?

1 code implementation3 Jun 2022 Yimeng Min, Frederik Wenkel, Michael Perlmutter, Guy Wolf

We propose a geometric scattering-based graph neural network (GNN) for approximating solutions of the NP-hard maximum clique (MC) problem.

Overcoming Oversmoothness in Graph Convolutional Networks via Hybrid Scattering Networks

no code implementations22 Jan 2022 Frederik Wenkel, Yimeng Min, Matthew Hirn, Michael Perlmutter, Guy Wolf

We further introduce an attention framework that allows the model to locally attend over combined information from different filters at the node level.

Approximating Excited States using Neural Networks

1 code implementation24 Dec 2020 Yimeng Min

Recently developed neural network-based wave function methods are capable of achieving state-of-the-art results for finding the ground state in real space.

Computational Physics Disordered Systems and Neural Networks

Geometric Scattering Attention Networks

1 code implementation28 Oct 2020 Yimeng Min, Frederik Wenkel, Guy Wolf

Geometric scattering has recently gained recognition in graph representation learning, and recent work has shown that integrating scattering features in graph convolution networks (GCNs) can alleviate the typical oversmoothing of features in node representation learning.

Graph Representation Learning Node Classification

Persistent Neurons

no code implementations2 Jul 2020 Yimeng Min

More precisely, we utilize the end of trajectories and let the parameters explore new landscapes by penalizing the model from converging to the previous solutions under the same initialization.

Scattering GCN: Overcoming Oversmoothness in Graph Convolutional Networks

1 code implementation NeurIPS 2020 Yimeng Min, Frederik Wenkel, Guy Wolf

Graph convolutional networks (GCNs) have shown promising results in processing graph data by extracting structure-aware features.

Graph Attention Node Classification

Predicting ice flow using machine learning

no code implementations20 Oct 2019 Yimeng Min, S. Karthik Mukkavilli, Yoshua Bengio

Though machine learning has achieved notable success in modeling sequential and spatial data for speech recognition and in computer vision, applications to remote sensing and climate science problems are seldom considered.

BIG-bench Machine Learning Management +3

Beyond Classical Diffusion: Ballistic Graph Neural Network

no code implementations25 Sep 2019 Yimeng Min

The filters propagate exponentially faster($\sigma^2 \sim T^2$) comparing to traditional graph neural network($\sigma^2 \sim T$).

Cannot find the paper you are looking for? You can Submit a new open access paper.