Demo Data from SIGIR 2026 / reviewers in the wild / expert
Aneesh Muppidi
dblp:296/4666
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 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 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
1 paper |
Reinforcement learning · 25% Deep learning architectures and training · 25% Learning theory · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › non-stationary reinforcement learning
continual reinforcement learning |
0.8 | 1 | 2024 | Fast TRAC: A Parameter-Free Optimizer for Lifelong Reinforcement Learning · NeurIPS 2024 |
Machine learning › Learning theory › online learning
online convex optimization |
0.8 | 1 | 2024 | Fast TRAC: A Parameter-Free Optimizer for Lifelong Reinforcement Learning · NeurIPS 2024 |
Machine learning › Optimization for machine learning › adaptive optimization
parameter-free optimization |
0.8 | 1 | 2024 | Fast TRAC: A Parameter-Free Optimizer for Lifelong Reinforcement Learning · NeurIPS 2024 |
Machine learning › Deep learning architectures and training › training dynamics
plasticity loss |
0.8 | 1 | 2024 | Fast TRAC: A Parameter-Free Optimizer for Lifelong Reinforcement Learning · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
regularization · 0.8online convex optimization · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Resampling-free Particle Filters in High-dimensionsabstractState estimation is crucial for the performance and safety of numerous robotic applications. Among the suite of estimation techniques, particle filters have been identified as a powerful solution due to their non-parametric nature. Yet, in high-dimensional state spaces, these filters face challenges such as ’particle deprivation’ which hinders accurate representation of the true posterior distribution. This paper introduces a novel resampling-free particle filter designed to mitigate particle deprivation by forgoing the traditional resampling step. This ensures a broader and more diverse particle set, especially vital in high-dimensional scenarios. Theoretically, our proposed filter is shown to offer a near-accurate representation of the desired posterior distribution in high-dimensional contexts. Empirically, the effectiveness of our approach is underscored through a high-dimensional synthetic state estimation task and a 6D pose estimation derived from videos. We posit that as robotic systems evolve with greater degrees of freedom, particle filters tailored for high-dimensional state spaces will be indispensable. Akhilan Boopathy, Aneesh Muppidi, Peggy Yang, Abhiram Iyer, William Yue, Ila Fiete |
ICRA | 2 |
| 2024 | Fast TRAC: A Parameter-Free Optimizer for Lifelong Reinforcement LearningabstractA key challenge in lifelong reinforcement learning (RL) is the loss of plasticity, where previous learning progress hinders an agent's adaptation to new tasks. While regularization and resetting can help, they require precise hyperparameter selection at the outset and environment-dependent adjustments. Building on the principled theory of online convex optimization, we present a parameter-free optimizer for lifelong RL, called TRAC, which requires no tuning or prior knowledge about the distribution shifts. Extensive experiments on Procgen, Atari, and Gym Control environments show that TRAC works surprisingly well—mitigating loss of plasticity and rapidly adapting to challenging distribution shifts—despite the underlying optimization problem being nonconvex and nonstationary. Aneesh Muppidi |
NeurIPS | 1 |
| 2021 | Speech Emotion Recognition Using Quaternion Convolutional Neural NetworksabstractAlthough speech recognition has become a widespread technology, inferring emotion from speech signals remains a challenge. Our paper addresses this problem by proposing a quaternion convolutional neural network (QCNN) based speech emotion recognition (SER) model in which Mel-spectrogram features of speech signals are encoded in an RGB quaternion domain. We demonstrate that our QCNN based SER model outperforms other real-valued methods in the Ryerson Audio-Visual Database of Emotional Speech and Song (RAVDESS, 8-classes) dataset, achieving, to the best of our knowledge, state-of-the-art results. The QCNN model also achieves comparable results with state-of-the-art methods in the Interactive Emotional Dyadic Motion Capture (IEMOCAP 4-classes) and Berlin EMO-DB (7-classes) datasets. Specifically, the model achieves an accuracy of 77.87%, 70.46%, and 88.78% for the RAVDESS, IEMOCAP, and EMO-DB datasets, respectively. Additionally, model size results reveal that the quaternion unit structure is significantly better able to encode internal dependencies than real-valued structures. Aneesh Muppidi, Martin Radfar |
ICASSP | 1 |