paper-with-me

Papers

Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under $\ell_p$ Distances

2018-07-01 · ICML 2018 7 · Grigory Yaroslavtsev, Adithya Vadapalli

We present first massively parallel (MPC) algorithms and hardness of approximation results for computing Single-Linkage Clustering of n input d-dimensional vectors under Hamming, $\ell_1, \ell_2$ and $\ell_\infty$ distances. All our algorithms run in O(log n) rounds of MPC for any fixed d and achieve (1+\epsilon)-approximation for all distances (except Hamming for which we show an exact algorithm). We also show constant-factor inapproximability results for o(\log n)-round algorithms under standard MPC hardness assumptions (for sufficiently large dimension depending on the distance used). Efficiency of implementation of our algorithms in Apache Spark is demonstrated through experiments on the largest available vector datasets from the UCI machine learning repository exhibiting speedups of several orders of magnitude.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Similar Papers 제목 키워드 기반

PANDORA: A Parallel Dendrogram Construction Algorithm for Single Linkage Clustering on GPU

2024-01-11 · Piyush Sao, Andrey Prokopenko, Damien Lebrun-Grandié

This paper presents \pandora, a novel parallel algorithm for efficiently constructing dendrograms for single-linkage hierarchical clustering, including \hdbscan. Traditional dendrogram construction methods from a minimum…

ClusteringGPU

A Massively Parallel Digital Learning Processor

2008-12-01 · NeurIPS 2008 12 · Hans P. Graf, Srihari Cadambi, Venkata Jakkula, Murugan Sankaradass 외

We present a new, massively parallel architecture for accelerating machine learning algorithms, based on arrays of variable-resolution arithmetic vector processing elements (VPE). Groups of VPEs operate in SIMD (single i…

ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain

2021-06-08 · Shangdi Yu, Yiqiu Wang, Yan Gu, Laxman Dhulipala 외

This paper studies the hierarchical clustering problem, where the goal is to produce a dendrogram that represents clusters at varying scales of a data set. We propose the ParChain framework for designing parallel hierarc…

Clustering

Benchmarking Massively Parallelized Multi-Task Reinforcement Learning for Robotics Tasks

2025-07-31 · Viraj Joshi, Zifan Xu, Bo Liu, Peter Stone 외 arxiv

Multi-task Reinforcement Learning (MTRL) has emerged as a critical training paradigm for applying reinforcement learning (RL) to a set of complex real-world robotic tasks, which demands a generalizable and robust policy.…

Reinforcement Learning

Wireless Sensor Networks as Parallel and Distributed Hardware Platform for Artificial Neural Networks

2025-10-30 · Gursel Serpen arxiv

We are proposing fully parallel and maximally distributed hardware realization of a generic neuro-computing system. More specifically, the proposal relates to the wireless sensor networks technology to serve as a massive…