Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Melih Elibol

dblp:228/0272 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
1since 2021 · last 2023
0009-0004-3115-6793ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-authorSystems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Optimization for machine learning · 78% Efficient and distributed learning · 17% Reinforcement learning · 5%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
High-performance computing · 44% Parallel and multicore computing · 44% GPUs and heterogeneous computing · 13%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

Topics — the 10 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing › sparse linear algebra
sparse matrix computation
0.712023
Legate Sparse: Distributed Sparse Computing in Python · SC 2023
Machine learning › Optimization for machine learning
stochastic gradient descent
0.412020
Variance Reduction With Sparse Gradients · ICLR 2020
Machine learning › Optimization for machine learning
variance reduction
0.412020
Variance Reduction With Sparse Gradients · ICLR 2020
Machine learning › Efficient and distributed learning
automated machine learning
0.312018
Probabilistic Matrix Factorization for Automated Machine Learning · NeurIPS 2018
Machine learning › Optimization for machine learning › model-based optimization
bayesian optimization
0.312018
Probabilistic Matrix Factorization for Automated Machine Learning · NeurIPS 2018
Machine learning › Optimization for machine learning
hyperparameter optimization
0.312018
Probabilistic Matrix Factorization for Automated Machine Learning · NeurIPS 2018
Recommender systems
collaborative filtering
0.312018
Probabilistic Matrix Factorization for Automated Machine Learning · NeurIPS 2018
Recommender systems › collaborative filtering › matrix factorization
probabilistic matrix factorization
0.312018
Probabilistic Matrix Factorization for Automated Machine Learning · NeurIPS 2018
GPUs and heterogeneous computing
multi-GPU computing
0.212023
Legate Sparse: Distributed Sparse Computing in Python · SC 2023
Machine learning › Reinforcement learning › large-scale reinforcement learning
distributed reinforcement learning
0.112018
Ray: A Distributed Framework for Emerging AI Applications · OSDI 2018

Methods — techniques the papers use, named apart from their topics

static and dynamic distribution techniques · 0.7probabilistic matrix factorization · 0.7collaborative filtering · 0.7bayesian optimization · 0.7variance reduction · 0.4sparse gradients · 0.4
YearPublicationVenuePosition
2023 Legate Sparse: Distributed Sparse Computing in Python
abstract
The sparse module of the popular SciPy Python library is widely used across applications in scientific computing, data analysis and machine learning. The standard implementation of SciPy is restricted to a single CPU and cannot take advantage of modern distributed and accelerated computing resources. We introduce Legate Sparse, a system that transparently distributes and accelerates unmodified sparse matrix-based SciPy programs across clusters of CPUs and GPUs, and composes with cuNumeric, a distributed NumPy library. Legate Sparse uses a combination of static and dynamic techniques to efficiently compose independently written sparse and dense array programming libraries, providing a unified Python interface for distributed sparse and dense array computations. We show that Legate Sparse is competitive with single-GPU libraries like CuPy and achieves 65% of the performance of PETSc on up to 1280 CPU cores and 192 GPUs of the Summit supercomputer, while offering the productivity benefits of idiomatic SciPy and NumPy.
Rohan Yadav, Wonchan Lee, Melih Elibol, Manolis Papadakis, Taylor Lee Patti, Michael Garland, Alex Aiken, Fredrik Kjolstad, Michael Bauer 0001
SC3
2020 Variance Reduction With Sparse Gradients
Melih Elibol, Lihua Lei, Michael I. Jordan
ICLR1
2018 Probabilistic Matrix Factorization for Automated Machine Learning
abstract
In order to achieve state-of-the-art performance, modern machine learning techniques require careful data pre-processing and hyperparameter tuning. Moreover, given the ever increasing number of machine learning models being developed, model selection is becoming increasingly important. Automating the selection and tuning of machine learning pipelines, which can include different data pre-processing methods and machine learning models, has long been one of the goals of the machine learning community. In this paper, we propose to solve this meta-learning task by combining ideas from collaborative filtering and Bayesian optimization. Specifically, we use a probabilistic matrix factorization model to transfer knowledge across experiments performed in hundreds of different datasets and use an acquisition function to guide the exploration of the space of possible ML pipelines. In our experiments, we show that our approach quickly identifies high-performing pipelines across a wide range of datasets, significantly outperforming the current state-of-the-art.
Nicolò Fusi, Rishit Sheth, Melih Elibol
NeurIPS3
2018 Ray: A Distributed Framework for Emerging AI Applications
Philipp Moritz, Robert Nishihara, Stephanie Wang, Alexey Tumanov, Richard Liaw, Eric Liang, Melih Elibol, Zongheng Yang, William Paul, Michael I. Jordan, Ion Stoica
OSDI7