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

Pranav Agarwal

dblp:59/2238 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
2since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Computer networks · 2Systems, architecture and hardware · 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
Reinforcement learning · 67% Representation and self-supervised learning · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning
discrete representation learning
0.812024
Learning to Play Atari in a World of Tokens · ICML 2024
Machine learning › Reinforcement learning
model-based reinforcement learning
0.812024
Learning to Play Atari in a World of Tokens · ICML 2024
Machine learning › Reinforcement learning › sample efficiency
sample-efficient reinforcement learning
0.812024
Learning to Play Atari in a World of Tokens · ICML 2024
Storage systems › storage devices › storage media
probe storage
0.112010
Maximum-likelihood sequence detector for dynamic mode high density probe storage · IEEE Trans. Commun. 2010
Storage systems › signal processing
sequence detection
0.112010
Maximum-likelihood sequence detector for dynamic mode high density probe storage · IEEE Trans. Commun. 2010
Storage systems
signal processing
0.112010
Maximum-likelihood sequence detector for dynamic mode high density probe storage · IEEE Trans. Commun. 2010
Storage systems › signal processing
intersymbol interference
0.012010
Maximum-likelihood sequence detector for dynamic mode high density probe storage · IEEE Trans. Commun. 2010

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

world modeling · 0.8transformer encoder · 0.8transformer decoder · 0.8viterbi algorithm · 0.1simulation · 0.1channel modeling · 0.1
YearPublicationVenuePosition
2024 Learning to Play Atari in a World of Tokens
abstract
Model-based reinforcement learning agents utilizing transformers have shown improved sample efficiency due to their ability to model extended context, resulting in more accurate world models. However, for complex reasoning and planning tasks, these methods primarily rely on continuous representations. This complicates modeling of discrete properties of the real world such as disjoint object classes between which interpolation is not plausible. In this work, we introduce discrete abstract representations for transformer-based learning (DART), a sample-efficient method utilizing discrete representations for modeling both the world and learning behavior. We incorporate a transformer-decoder for auto-regressive world modeling and a transformer-encoder for learning behavior by attending to task-relevant cues in the discrete representation of the world model. For handling partial observability, we aggregate information from past time steps as memory tokens. DART outperforms previous state-of-the-art methods that do not use look-ahead search on the Atari 100k sample efficiency benchmark with a median human-normalized score of 0.790 and beats humans in 9 out of 26 games. We release our code at https://pranaval.github.io/DART/.
Pranav Agarwal, Sheldon Andrews, Samira Ebrahimi Kahou
ICML1
2023 TPTO: A Transformer-PPO based Task Offloading Solution for Edge Computing Environments
abstract
Emerging applications in healthcare, autonomous vehicles, and wearable assistance require interactive and low-latency data analysis services. Unfortunately, cloud-centric architectures cannot fulfill the low-latency demands of these applications, as user devices are often distant from cloud data centers. Edge computing aims to reduce the latency by enabling processing tasks to be offloaded to resources located at the network’s edge. However, determining which tasks must be offloaded to edge servers to reduce the latency of application requests is not trivial, especially if the tasks present dependencies. This paper proposes a Deep Reinforcement Learning (DRL) approach called TPTO, which leverages Transformer Networks and Proximal Policy Optimization (PPO) to offload dependent tasks of IoT applications in edge computing. We consider users with various preferences, where devices can offload computation to an edge server via wireless channels. Performance evaluation results demonstrate that under fat application graphs, TPTO is more effective than state-of-the-art methods, such as Greedy, HEFT, and MRLCO, by reducing latency by 30.24%, 29.61%, and 12.41%, respectively. In addition, TPTO presents a training time approximately 2.5 times faster than an existing DRL approach.
Niloofar Gholipour, Marcos Dias de Assunção, Pranav Agarwal, Julien Gascon-Samson, Rajkumar Buyya
ICPADS3
2020 Global-best optimization of ANN trained by PSO using the non-extensive cross-entropy with Gaussian gain
Seba Susan, Rohit Ranjan, Udyant Taluja, Shivang Rai, Pranav Agarwal
Soft Comput.5
2010 Maximum-likelihood sequence detector for dynamic mode high density probe storage
abstract
There is an increasing need for high density data storage devices driven by the increased demand of consumer electronics. In this work, we consider a data storage system that operates by encoding information as topographic profiles on a polymer medium. A cantilever probe with a sharp tip (few nm radius) is used to create and sense the presence of topographic profiles, resulting in a density of few Tb per in.2. The prevalent mode of using the cantilever probe is the static mode that is harsh on the probe and the media. In this article, the high quality factor dynamic mode operation, that is less harsh on the media and the probe, is analyzed. The read operation is modeled as a communication channel which incorporates system memory due to inter-symbol interference and the cantilever state. We demonstrate an appropriate level of abstraction of this complex nanoscale system that obviates the need for an involved physical model. Next, a solution to the maximum likelihood sequence detection problem based on the Viterbi algorithm is devised. Experimental and simulation results demonstrate that the performance of this detector is several orders of magnitude better than the performance of other existing schemes.
Naveen Kumar 0003, Pranav Agarwal, Aditya Ramamoorthy, Murti V. Salapaka
IEEE Trans. Commun.2
2009 Maximum-Likelihood Sequence Detector for Dynamic Mode High Density Probe Storage
abstract
There is an ever increasing need for storing data in small form factors driven by the ubiquitous use and increased demands of consumer electronics. A new data storage approach that achieves a few Tb per in2areal densities, utilizes a cantilever probe with a sharp tip that can be used to deform and assess the topography of a polymer medium. The information may be encoded by means of topographic profiles on the medium. The prevalent mode of using the cantilever probe is the static mode that is known to be harsh on the probe and the media. In this paper, the high quality factor dynamic mode operation, which is known to be less harsh on the media and the probe, is analyzed for probe based high density data storage purposes. It is demonstrated that an appropriate level of abstraction is possible that obviates the need for an involved physical model. The read operation is modeled as a communication channel which incorporates the inherent system memory due to the intersymbol interference and the cantilever state that can be identified using training data. Using the identified model, a solution to the maximum likelihood sequence detection problem based on the Viterbi algorithm is devised. Experimental and simulation results demonstrate that the performance of this detector is several orders of magnitude better than the other existing schemes and confirms performance gains that can render the dynamic mode operation feasible for high density data storage purposes.
Naveen Kumar 0003, Pranav Agarwal, Aditya Ramamoorthy, Murti V. Salapaka
GLOBECOM2