https://github.com/AegisIK/DistMLIP
공식 코드DistMLIP: A Distributed Inference Platform for Machine Learning Interatomic Potentials
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
Graph Partitioning is generally the first step of distributed graph computing tasks. The targets are load-balance and minimizing the communication volume.
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
DistMLIP: A Distributed Inference Platform for Machine Learning Interatomic Potentials
Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
Fine-tuning Partition-aware Item Similarities for Efficient and Scalable Recommendation
Towards the efficacy of federated prediction for epidemics on networks
Neural Improvement Heuristics for Graph Combinatorial Optimization Problems
Graph Partitioning and Sparse Matrix Ordering using Reinforcement Learning and Graph Neural Networks
Exploring Key Point Analysis with Pairwise Generation and Graph Partitioning
Robust Fair Clustering: A Novel Fairness Attack and Defense Framework
Creating Multi-Level Skill Hierarchies in Reinforcement Learning
PGT-I: Scaling Spatiotemporal GNNs with Memory-Efficient Distributed Training
A 3D Convolutional Approach to Spectral Object Segmentation in Space and Time
Leveraging Domain Knowledge to Improve Microscopy Image Segmentation with Lifted Multicuts
Reformulating DOVER-Lap Label Mapping as a Graph Partitioning Problem
DistDGL: Distributed Graph Neural Network Training for Billion-Scale Graphs
Deep Spectral Improvement for Unsupervised Image Instance Segmentation
Deep Spectral Improvement for Unsupervised Image Instance Segmentation
A Structure-Aware Framework for Learning Device Placements on Computation Graphs
Fast Multi-view Clustering via Ensembles: Towards Scalability, Superiority, and Simplicity
Learning Spatial Context with Graph Neural Network for Multi-Person Pose Grouping
Spectral Normalized-Cut Graph Partitioning with Fairness Constraints
Towards Faster Graph Partitioning via Pre-training and Inductive Inference
Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
FairGP: A Scalable and Fair Graph Transformer Using Graph Partitioning
Approximate spectral clustering density-based similarity for noisy datasets
Approximate spectral clustering with eigenvector selection and self-tuned $k$
Graph Construction using Principal Axis Trees for Simple Graph Convolution
Random Projection Forest Initialization for Graph Convolutional Networks
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.