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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Riyasat Ohib

dblp:255/5019 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021

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
1 paper
Efficient and distributed learning · 70% Reinforcement learning · 30%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
efficient reinforcement learning
0.812024
Efficient Reinforcement Learning by Discovering Neural Pathways · NeurIPS 2024
Machine learning › Efficient and distributed learning
model compression
0.812024
Efficient Reinforcement Learning by Discovering Neural Pathways · NeurIPS 2024
Machine learning › Efficient and distributed learning › model compression
pruning
0.812024
Efficient Reinforcement Learning by Discovering Neural Pathways · NeurIPS 2024
Machine learning › Efficient and distributed learning › automated machine learning
subnetwork discovery
0.812024
Efficient Reinforcement Learning by Discovering Neural Pathways · NeurIPS 2024
Machine learning › Reinforcement learning
continuous control
0.212024
Efficient Reinforcement Learning by Discovering Neural Pathways · NeurIPS 2024

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

multi-task learning · 0.8lottery ticket hypothesis · 0.8
YearPublicationVenuePosition
2024 Efficient Reinforcement Learning by Discovering Neural Pathways
abstract
Reinforcement learning (RL) algorithms have been very successful at tackling complex control problems, such as AlphaGo or fusion control. However, current research mainly emphasizes solution quality, often achieved by using large models trained on large amounts of data, and does not account for the financial, environmental, and societal costs associated with developing and deploying such models. Modern neural networks are often overparameterized and a significant number of parameters can be pruned without meaningful loss in performance, resulting in more efficient use of the model's capacity lottery ticket. We present a methodology for identifying sub-networks within a larger network in reinforcement learning (RL). We call such sub-networks, neural pathways. We show empirically that even very small learned sub-networks, using less than 5% of the large network's parameters, can provide very good quality solutions. We also demonstrate the training of multiple pathways within the same networks in a multitask setup, where each pathway is encouraged to tackle a separate task. We evaluate empirically our approach on several continuous control tasks, in both online and offline training
Samin Yeasar Arnob, Riyasat Ohib, Sergey M. Plis, Amy Zhang 0001, Alessandro Sordoni, Doina Precup
NeurIPS2