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

Arun Ahuja

dblp:14/9014 · DBLP profile ↗
← Back
15ranked-venue papers
1as first author
5since 2021 · last 2024
0000-0003-3452-3128ORCID · corroborated

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

Artificial intelligence and machine learning · 13 · 1 first-author · 5 since 2021Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 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
11 papers
Reinforcement learning · 42% Language models and text generation · 18% Motion planning and robot control · 13%
Databases, data mining, and information retrieval
2 papers
Information retrieval · 84% Distributed and cloud data management · 16%
Computer graphics and multimedia
1 paper
Computer animation and physical simulation · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control
humanoid robot control
0.822019
Neural Probabilistic Motor Primitives for Humanoid Control · ICLR (Poster) 2019
Hierarchical Visuomotor Control of Humanoids · ICLR (Poster) 2019
Natural language and speech › Language models and text generation › large language model › large language model adaptation
supervised fine-tuning
0.812024
Imitating Language via Scalable Inverse Reinforcement Learning · NeurIPS 2024
Natural language and speech › Language models and text generation
instruction following
0.712023
Distilling Internet-Scale Vision-Language Models into Embodied Agents · ICML 2023
Computer vision › Vision and language › visual grounding
language grounding
0.712023
Distilling Internet-Scale Vision-Language Models into Embodied Agents · ICML 2023
Machine learning › Efficient and distributed learning › model compression › knowledge distillation
model distillation
0.712023
Distilling Internet-Scale Vision-Language Models into Embodied Agents · ICML 2023
Computer vision › Vision and language
vision-language model
0.712023
Distilling Internet-Scale Vision-Language Models into Embodied Agents · ICML 2023
Machine learning › Reinforcement learning
behavioral prior
0.612022
Behavior Priors for Efficient Reinforcement Learning · J. Mach. Learn. Res. 2022
Machine learning › Reinforcement learning
hierarchical reinforcement learning
0.612022
Behavior Priors for Efficient Reinforcement Learning · J. Mach. Learn. Res. 2022
Information retrieval
fact-checking
0.612022
Learning to Navigate Wikipedia by Taking Random Walks · NeurIPS 2022
Information retrieval
web search
0.612022
Learning to Navigate Wikipedia by Taking Random Walks · NeurIPS 2022
Machine learning › Reinforcement learning
imitation learning
0.512021
Imitation by Predicting Observations · ICML 2021
Machine learning › Reinforcement learning › imitation learning
inverse reinforcement learning
0.512021
Imitation by Predicting Observations · ICML 2021
Machine learning › Reinforcement learning › imitation learning
learning from observation
0.512021
Imitation by Predicting Observations · ICML 2021
Machine learning › Reinforcement learning › policy optimization
maximum a posteriori policy optimization
0.412020
V-MPO: On-Policy Maximum a Posteriori Policy Optimization for Discrete and Continuous Control · ICLR 2020
Machine learning › Reinforcement learning › policy optimization
on-policy optimization
0.412020
V-MPO: On-Policy Maximum a Posteriori Policy Optimization for Discrete and Continuous Control · ICLR 2020
Machine learning › Reinforcement learning
policy optimization
0.412020
V-MPO: On-Policy Maximum a Posteriori Policy Optimization for Discrete and Continuous Control · ICLR 2020
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning
predictive representation learning
0.412020
Probing Emergent Semantics in Predictive Agents via Question Answering · ICML 2020
Computer animation and physical simulation › character animation
physics-based character animation
0.412020
Catch & Carry: reusable neural controllers for vision-guided whole-body tasks · ACM Trans. Graph. 2020
Machine learning › Learning paradigms › continual learning
catastrophic forgetting
0.412019
Experience Replay for Continual Learning · NeurIPS 2019
Machine learning › Learning paradigms
continual learning
0.412019
Experience Replay for Continual Learning · NeurIPS 2019
Machine learning › Reinforcement learning › off-policy reinforcement learning
experience replay
0.412019
Experience Replay for Continual Learning · NeurIPS 2019
Robotics › Motion planning and robot control › robot control
hierarchical control
0.412019
Hierarchical Visuomotor Control of Humanoids · ICLR (Poster) 2019
Robotics › Motion planning and robot control › robot learning
movement primitives
0.412019
Neural Probabilistic Motor Primitives for Humanoid Control · ICLR (Poster) 2019
High-performance computing
scientific computing systems
0.212015
Rethinking Data-Intensive Science Using Scalable Analytics Systems · SIGMOD Conference 2015
Machine learning › Reinforcement learning › off-policy reinforcement learning › experience replay
hindsight experience replay
0.212023
Distilling Internet-Scale Vision-Language Models into Embodied Agents · ICML 2023
Machine learning › Reinforcement learning
multi-task reinforcement learning
0.212022
Behavior Priors for Efficient Reinforcement Learning · J. Mach. Learn. Res. 2022
Bioinformatics and computational biology › genomics
genomic data analysis
0.112015
Rethinking Data-Intensive Science Using Scalable Analytics Systems · SIGMOD Conference 2015

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

behavioral cloning · 1.5random walk trajectories · 1.1TF-IDF · 1.1temporal difference regularization · 0.8maximum likelihood estimation · 0.8inverse soft-q learning · 0.8vision-language model · 0.7few-shot prompting · 0.7horizontally scalable analytics · 0.7probabilistic modeling · 0.6mutual information objective · 0.6motor primitive · 0.4human demonstration · 0.4curriculum learning · 0.4
YearPublicationVenuePosition
2024 Imitating Language via Scalable Inverse Reinforcement Learning
abstract
The majority of language model training builds on imitation learning. It covers pretraining, supervised fine-tuning, and affects the starting conditions for reinforcement learning from human feedback (RLHF). The simplicity and scalability of maximum likelihood estimation (MLE) for next token prediction led to its role as predominant paradigm. However, the broader field of imitation learning can more effectively utilize the sequential structure underlying autoregressive generation. We focus on investigating the inverse reinforcement learning (IRL) perspective to imitation, extracting rewards and directly optimizing sequences instead of individual token likelihoods and evaluate its benefits for fine-tuning large language models. We provide a new angle, reformulating inverse soft-Q-learning as a temporal difference regularized extension of MLE. This creates a principled connection between MLE and IRL and allows trading off added complexity with increased performance and diversity of generations in the supervised fine-tuning (SFT) setting. We find clear advantages for IRL-based imitation, in particular for retaining diversity while maximizing task performance, rendering IRL a strong alternative on fixed SFT datasets even without online data generation. Our analysis of IRL-extracted reward functions further indicates benefits for more robust reward functions via tighter integration of supervised and preference-based LLM post-training.
Markus Wulfmeier, Michael Bloesch, Nino Vieillard, Arun Ahuja, Jörg Bornschein, Sandy H. Huang, Artem Sokolov 0001, Matt Barnes 0001, Guillaume Desjardins, Alex Bewley, Sarah Bechtle, Jost Tobias Springenberg, Nikola Momchev, Olivier Bachem, Matthieu Geist, Martin A. Riedmiller
NeurIPS4
2023 Distilling Internet-Scale Vision-Language Models into Embodied Agents
abstract
Instruction-following agents must ground language into their observation and action spaces. Learning to ground language is challenging, typically requiring domain-specific engineering or large quantities of human interaction data. To address this challenge, we propose using pretrained vision-language models (VLMs) to supervise embodied agents. We combine ideas from model distillation and hindsight experience replay (HER), using a VLM to retroactively generate language describing the agent’s behavior. Simple prompting allows us to control the supervision signal, teaching an agent to interact with novel objects based on their names (e.g., planes) or their features (e.g., colors) in a 3D rendered environment. Fewshot prompting lets us teach abstract category membership, including pre-existing categories (food vs toys) and ad-hoc ones (arbitrary preferences over objects). Our work outlines a new and effective way to use internet-scale VLMs, repurposing the generic language grounding acquired by such models to teach task-relevant groundings to embodied agents.
Theodore R. Sumers, Kenneth Marino, Arun Ahuja, Rob Fergus, Ishita Dasgupta 0001
ICML3
2022 Learning to Navigate Wikipedia by Taking Random Walks
abstract
A fundamental ability of an intelligent web-based agent is seeking out and acquiring new information. Internet search engines reliably find the correct vicinity but the top results may be a few links away from the desired target. A complementary approach is navigation via hyperlinks, employing a policy that comprehends local content and selects a link that moves it closer to the target. In this paper, we show that behavioral cloning of randomly sampled trajectories is sufficient to learn an effective link selection policy. We demonstrate the approach on a graph version of Wikipedia with 38M nodes and 387M edges. The model is able to efficiently navigate between nodes 5 and 20 steps apart 96% and 92% of the time, respectively. We then use the resulting embeddings and policy in downstream fact verification and question answering tasks where, in combination with basic TF-IDF search and ranking methods, they are competitive results to the state-of-the-art methods.
Manzil Zaheer, Kenneth Marino, Will Grathwohl, John Schultz, Wendy Shang, Sheila Babayan, Arun Ahuja, Ishita Dasgupta 0001, Christine Kaeser-Chen, Rob Fergus
NeurIPS7
2022 Behavior Priors for Efficient Reinforcement Learning
abstract
As we deploy reinforcement learning agents to solve increasingly challenging problems, methods that allow us to inject prior knowledge about the structure of the world and effective solution strategies becomes increasingly important. In this work we consider how information and architectural constraints can be combined with ideas from the probabilistic modeling literature to learn behavior priors that capture the common movement and interaction patterns that are shared across a set of related tasks or contexts. For example the day-to day behavior of humans comprises distinctive locomotion and manipulation patterns that recur across many different situations and goals. We discuss how such behavior patterns can be captured using probabilistic trajectory models and how these can be integrated effectively into reinforcement learning schemes, e.g. to facilitate multi-task and transfer learning. We then extend these ideas to latent variable models and consider a formulation to learn hierarchical priors that capture different aspects of the behavior in reusable modules. We discuss how such latent variable formulations connect to related work on hierarchical reinforcement learning (HRL) and mutual information and curiosity based objectives, thereby offering an alternative perspective on existing ideas. We demonstrate the effectiveness of our framework by applying it to a range of simulated continuous control domains, videos of which can be found at the following url: https://sites.google.com/view/behavior-priors.
Dhruva Tirumala, Alexandre Galashov, Hyeonwoo Noh, Leonard Hasenclever, Razvan Pascanu, Jonathan Schwarz, Guillaume Desjardins, Wojciech Czarnecki 0001, Arun Ahuja, Yee Whye Teh, Nicolas Heess
J. Mach. Learn. Res.9
2021 Imitation by Predicting Observations
abstract
Imitation learning enables agents to reuse and adapt the hard-won expertise of others, offering a solution to several key challenges in learning behavior. Although it is easy to observe behavior in the real-world, the underlying actions may not be accessible. We present a new method for imitation solely from observations that achieves comparable performance to experts on challenging continuous control tasks while also exhibiting robustness in the presence of observations unrelated to the task. Our method, which we call FORM (for "Future Observation Reward Model") is derived from an inverse RL objective and imitates using a model of expert behavior learned by generative modelling of the expert’s observations, without needing ground truth actions. We show that FORM performs comparably to a strong baseline IRL method (GAIL) on the DeepMind Control Suite benchmark, while outperforming GAIL in the presence of task-irrelevant features.
Andrew Jaegle, Yury Sulsky, Arun Ahuja, Jake Bruce, Rob Fergus, Greg Wayne
ICML3
2020 V-MPO: On-Policy Maximum a Posteriori Policy Optimization for Discrete and Continuous Control
H. Francis Song, Abbas Abdolmaleki, Jost Tobias Springenberg, Aidan Clark, Hubert Soyer, Jack W. Rae, Seb Noury, Arun Ahuja, Siqi Liu 0002, Dhruva Tirumala, Nicolas Heess, Daniel Belov, Martin A. Riedmiller, Matt M. Botvinick
ICLR8
2020 Probing Emergent Semantics in Predictive Agents via Question Answering
abstract
Recent work has shown how predictive modeling can endow agents with rich knowledge of their surroundings, improving their ability to act in complex environments. We propose question-answering as a general paradigm to decode and understand the representations that such agents develop, applying our method to two recent approaches to predictive modelling - action-conditional CPC (Guo et al., 2018) and SimCore (Gregor et al., 2019). After training agents with these predictive objectives in a visually-rich, 3D environment with an assortment of objects, colors, shapes, and spatial configurations, we probe their internal state representations with a host of synthetic (English) questions, without backpropagating gradients from the question-answering decoder into the agent. The performance of different agents when probed in this way reveals that they learn to encode factual, and seemingly compositional, information about objects, properties and spatial relations from their physical environment. Our approach is intuitive, i.e. humans can easily interpret the responses of the model as opposed to inspecting continuous vectors, and model-agnostic, i.e. applicable to any modeling approach. By revealing the implicit knowledge of objects, quantities, properties and relations acquired by agents as they learn, question-conditional agent probing can stimulate the design and development of stronger predictive learning objectives.
Federico Carnevale, Hamza Merzic, Laura Rimell, Rosália G. Schneider, Josh Abramson, Alden Hung, Arun Ahuja, Stephen Clark, Greg Wayne, Felix Hill
ICML8
2020 Catch & Carry: reusable neural controllers for vision-guided whole-body tasks
abstract
We address the longstanding challenge of producing flexible, realistic humanoid character controllers that can perform diverse whole-body tasks involving object interactions. This challenge is central to a variety of fields, from graphics and animation to robotics and motor neuroscience. Our physics-based environment uses realistic actuation and first-person perception - including touch sensors and egocentric vision - with a view to producing active-sensing behaviors (e.g. gaze direction), transferability to real robots, and comparisons to the biology. We develop an integrated neural-network based approach consisting of a motor primitive module, human demonstrations, and an instructed reinforcement learning regime with curricula and task variations. We demonstrate the utility of our approach for several tasks, including goal-conditioned box carrying and ball catching, and we characterize its behavioral robustness. The resulting controllers can be deployed in real-time on a standard PC. 1
Josh Merel, Saran Tunyasuvunakool, Arun Ahuja, Yuval Tassa, Leonard Hasenclever, Tom Erez, Greg Wayne, Nicolas Heess
ACM Trans. Graph.3
2019 Hierarchical Visuomotor Control of Humanoids
Josh Merel, Arun Ahuja, Saran Tunyasuvunakool, Siqi Liu 0002, Dhruva Tirumala, Nicolas Heess, Greg Wayne
ICLR (Poster)2
2019 Neural Probabilistic Motor Primitives for Humanoid Control
Josh Merel, Leonard Hasenclever, Alexandre Galashov, Arun Ahuja, Greg Wayne, Yee Whye Teh, Nicolas Heess
ICLR (Poster)4
2019 Experience Replay for Continual Learning
abstract
Interacting with a complex world involves continual learning, in which tasks and data distributions change over time. A continual learning system should demonstrate both plasticity (acquisition of new knowledge) and stability (preservation of old knowledge). Catastrophic forgetting is the failure of stability, in which new experience overwrites previous experience. In the brain, replay of past experience is widely believed to reduce forgetting, yet it has been largely overlooked as a solution to forgetting in deep reinforcement learning. Here, we introduce CLEAR, a replay-based method that greatly reduces catastrophic forgetting in multi-task reinforcement learning. CLEAR leverages off-policy learning and behavioral cloning from replay to enhance stability, as well as on-policy learning to preserve plasticity. We show that CLEAR performs better than state-of-the-art deep learning techniques for mitigating forgetting, despite being significantly less complicated and not requiring any knowledge of the individual tasks being learned.
David Rolnick, Arun Ahuja, Jonathan Schwarz, Timothy P. Lillicrap, Greg Wayne
NeurIPS2
2015 Rethinking Data-Intensive Science Using Scalable Analytics Systems
abstract
"Next generation" data acquisition technologies are allowing scientists to collect exponentially more data at a lower cost. These trends are broadly impacting many scientific fields, including genomics, astronomy, and neuroscience. We can attack the problem caused by exponential data growth by applying horizontally scalable techniques from current analytics systems to accelerate scientific processing pipelines.
Frank A. Nothaft, Matt Massie, Timothy Danford, Zhao Zhang 0007, Uri Laserson, Carl Yeksigian, Jey Kottalam, Arun Ahuja, Jeff Hammerbacher, Michael D. Linderman, Michael J. Franklin, Anthony D. Joseph, David A. Patterson 0001
SIGMOD Conference8
2014 Learning Representations for Weakly Supervised Natural Language Processing Tasks
abstract
Finding the right representations for words is critical for building accurate NLP systems when domain-specific labeled data for the task is scarce. This article investigates novel techniques for extracting features from n-gram models, Hidden Markov Models, and other statistical language models, including a novel Partial Lattice Markov Random Field model. Experiments on part-of-speech tagging and information extraction, among other tasks, indicate that features taken from statistical language models, in combination with more traditional features, outperform traditional representations alone, and that graphical model representations outperform n-gram models, especially on sparse and polysemous words.
Fei Huang 0008, Arun Ahuja, Doug Downey, Yi Yang 0042, Yuhong Guo, Alexander Yates
Comput. Linguistics2
2011 Language Models as Representations for Weakly Supervised NLP Tasks
Fei Huang 0008, Alexander Yates, Arun Ahuja, Doug Downey
CoNLL3
2010 Improved Extraction Assessment through Better Language Models
Arun Ahuja, Doug Downey
HLT-NAACL1