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

Somjit Nath

dblp:224/9384 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
4since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 7 · 4 first-author · 4 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 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
4 papers
Reinforcement learning · 58% 3D vision · 18% Deep learning architectures and training · 12%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › off-policy reinforcement learning
experience replay
0.712023
Prioritizing Samples in Reinforcement Learning with Reducible Loss · NeurIPS 2023
Machine learning › Reinforcement learning › value function estimation
general value functions
0.712023
Discovering Object-Centric Generalized Value Functions From Pixels · ICML 2023
Computer vision › 3D vision
object representation
0.712023
Discovering Object-Centric Generalized Value Functions From Pixels · ICML 2023
Machine learning › Learning theory
online learning
0.412020
Training Recurrent Neural Networks Online by Learning Explicit State Variables · ICLR 2020
Machine learning › Deep learning architectures and training
recurrent neural network
0.412020
Training Recurrent Neural Networks Online by Learning Explicit State Variables · ICLR 2020
Machine learning › Reinforcement learning
two-timescale stochastic approximation
0.412019
Two-Timescale Networks for Nonlinear Value Function Approximation · ICLR (Poster) 2019
Machine learning › Reinforcement learning
value function approximation
0.412019
Two-Timescale Networks for Nonlinear Value Function Approximation · ICLR (Poster) 2019

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

temporal-difference loss · 0.7pseudo-rewards · 0.7experience replay · 0.7auxiliary tasks · 0.7explicit state variables · 0.4
YearPublicationVenuePosition
2023 Discovering Object-Centric Generalized Value Functions From Pixels
abstract
Deep Reinforcement Learning has shown significant progress in extracting useful representations from high-dimensional inputs albeit using hand-crafted auxiliary tasks and pseudo rewards. Automatically learning such representations in an object-centric manner geared towards control and fast adaptation remains an open research problem. In this paper, we introduce a method that tries to discover meaningful features from objects, translating them to temporally coherent `question' functions and leveraging the subsequent learned general value functions for control. We compare our approach with state-of-the-art techniques alongside other ablations and show competitive performance in both stationary and non-stationary settings. Finally, we also investigate the discovered general value functions and through qualitative analysis show that the learned representations are not only interpretable but also, centered around objects that are invariant to changes across tasks facilitating fast adaptation.
Somjit Nath, Gopeshh Raaj Subbaraj, Khimya Khetarpal, Samira Ebrahimi Kahou
ICML1
2023 Prioritizing Samples in Reinforcement Learning with Reducible Loss
abstract
Most reinforcement learning algorithms take advantage of an experience replay buffer to repeatedly train on samples the agent has observed in the past. Not all samples carry the same amount of significance and simply assigning equal importance to each of the samples is a naïve strategy. In this paper, we propose a method to prioritize samples based on how much we can learn from a sample. We define the learn-ability of a sample as the steady decrease of the training loss associated with this sample over time. We develop an algorithm to prioritize samples with high learn-ability, while assigning lower priority to those that are hard-to-learn, typically caused by noise or stochasticity. We empirically show that across multiple domains our method is more robust than random sampling and also better than just prioritizing with respect to the training loss, i.e. the temporal difference loss, which is used in prioritized experience replay.
Shivakanth Sujit, Somjit Nath, Pedro H. M. Braga, Samira Ebrahimi Kahou
NeurIPS2
2022 Scalable multi-product inventory control with lead time constraints using reinforcement learning
Hardik Meisheri, Nazneen N. Sultana, Mayank Baranwal, Vinita Baniwal, Somjit Nath, Satyam Verma, Balaraman Ravindran, Harshad Khadilkar
Neural Comput. Appl.5
2021 Revisiting State Augmentation methods for Reinforcement Learning with Stochastic Delays
abstract
Several real-world scenarios, such as remote control and sensing, are comprised of action and observation delays. The presence of delays degrades the performance of reinforcement learning (RL) algorithms, often to such an extent that algorithms fail to learn anything substantial. This paper formally describes the notion of Markov Decision Processes (MDPs) with stochastic delays and shows that delayed MDPs can be transformed into equivalent standard MDPs (without delays) with significantly simplified cost structure. We employ this equivalence to derive a model-free Delay-Resolved RL framework and show that even a simple RL algorithm built upon this framework achieves near-optimal rewards in environments with stochastic delays in actions and observations. The delay-resolved deep Q-network (DRDQN) algorithm is bench-marked on a variety of environments comprising of multi-step and stochastic delays and results in better performance, both in terms of achieving near-optimal rewards and minimizing the computational overhead thereof, with respect to the currently established algorithms.
Somjit Nath, Mayank Baranwal, Harshad Khadilkar
CIKM1
2020 Training Recurrent Neural Networks Online by Learning Explicit State Variables
Somjit Nath, Alan Chan 0001, Adam White 0001, Martha White
ICLR1
2019 Two-Timescale Networks for Nonlinear Value Function Approximation
Wesley Chung, Somjit Nath, Ajin Joseph 0001, Martha White
ICLR (Poster)2
2018 Smartphone camera-based analysis of ELISA using artificial neural network
abstract
The proposed method indicates an inexpensive, portable, and easily accessible method for the quantitative analysis of medical samples for the detection of disease in the enzyme‐linked immunosorbent assay (ELISA). The procedure follows a point‐of‐care diagnostic model and attends to the several challenges in healthcare system in rural settings. The proposed technique will alleviate the inconveniences faced by the average citizen of a country with insufficient resources to implement an affordable healthcare administration for its entire population. A smartphone is used to procure images of an ELISA containing para‐nitrophenol samples which is then fed into a machine learning algorithm, specifically artificial neural network. The introduction of two relatively new technologies in medical aid – the smartphone and machine learning not only reduces cost and time of detection, but also presents ample possibility for further development. The predictions result in highly accurate diagnostic labels. The same method can be used for blood samples for the prediction of presence of any disease, provided adequate training set has been deployed.
Somjit Nath, Subhannita Sarcar, Biswendu Chatterjee, Rhishita Chourashi, Nabendu Sekhar Chatterjee
IET Comput. Vis.1