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

Aarti Malhotra

dblp:153/6542 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0002-9983-3680ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 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.

Human-computer interaction and pervasive computing
1 paper
Human-AI interaction · 33% Wearable and physiological sensing · 33% Collaborative and social computing · 33%
Artificial intelligence
2 papers
Reinforcement learning · 36% Planning, search and constraint satisfaction · 36% Multi-agent systems · 28%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Human-AI interaction
affective computing
0.612022
Socially Intelligent Affective AI · AAAI 2022
Wearable and physiological sensing
emotion recognition
0.612022
Socially Intelligent Affective AI · AAAI 2022
Collaborative and social computing › social interaction › social interaction analysis
social signal processing
0.612022
Socially Intelligent Affective AI · AAAI 2022
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty › partially observable markov decision process
constrained POMDP
0.212015
Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes · AAAI 2015
Machine learning › Reinforcement learning
markov decision process
0.212015
Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes · AAAI 2015
Mathematical optimization › linear programming
approximate linear programming
0.212015
Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes · AAAI 2015
Mathematical optimization
linear programming
0.212015
Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes · AAAI 2015
Knowledge, reasoning and agents › Multi-agent systems
social intelligence
0.212022
Socially Intelligent Affective AI · AAAI 2022

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

computational models of emotion · 1.1affect prediction · 1.1point-based value iteration · 0.4
YearPublicationVenuePosition
2022 Socially Intelligent Affective AI
abstract
Artificial Intelligence has aimed to give the systems or agents, the ability to learn, perceive, recognize, plan, reason and act. Affective Computing has brought into focus the importance of giving AI systems, the capability to perceive, detect, utilize and generate emotion, affect, sentiment or feelings. To have a meaningful human-computer interaction, we need to design and develop a more socially intelligent and affective AI. My doctoral research goal is to delve deeper into some of these aspects, firstly by surveying computational models implemented in AI that uses emotion in decision-making or behaviour; secondly, by creating new model to predict social event context and affect in group videos; thirdly, to predict the social identities in visual scenes; and lastly to combine information about context, identities, behaviour and emotion in a social interaction scene to predict social incoherence and to recommend appropriate behaviour.
Aarti Malhotra
AAAI1
2015 Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes
abstract
In many situations, it is desirable to optimize a sequence of decisions by maximizing a primary objective while respecting some constraints with respect to secondary objectives. Such problems can be naturally modeled as constrained partially observable Markov decision processes (CPOMDPs) when the environment is partially observable. In this work, we describe a technique based on approximate linear programming to optimize policies in CPOMDPs. The optimization is performed offline and produces a finite state controller with desirable performance guarantees. The approach outperforms a constrained version of point-based value iteration on a suite of benchmark problems.
Pascal Poupart, Aarti Malhotra, Pei Pei, Kee-Eung Kim, Bongseok Goh, Michael H. Bowling
AAAI2