Demo Data from EDBT 2026 / reviewers in the wild / expert
Aditya Kumar Akash
dblp:153/2090
· DBLP profile ↗
3ranked-venue papers
1as first author
1since 2021 · last 2021
0000-0001-5166-9722ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 since 2021Systems, architecture and hardware · 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
3 papers |
Representation and self-supervised learning · 44% Trustworthy machine learning · 41% Multi-agent systems · 8% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning
fairness |
0.9 | 2 | 2021 | Learning Invariant Representations using Inverse Contrastive Loss · AAAI 2021 FairALM: Augmented Lagrangian Method for Training Fair Models with Little Regret · ECCV (12) 2020 |
Machine learning › Representation and self-supervised learning › contrastive learning
contrastive loss |
0.5 | 1 | 2021 | Learning Invariant Representations using Inverse Contrastive Loss · AAAI 2021 |
Machine learning › Representation and self-supervised learning
invariant representation |
0.5 | 1 | 2021 | Learning Invariant Representations using Inverse Contrastive Loss · AAAI 2021 |
Machine learning › Representation and self-supervised learning › representation learning
invariant representation learning |
0.5 | 1 | 2021 | Learning Invariant Representations using Inverse Contrastive Loss · AAAI 2021 |
Machine learning › Trustworthy machine learning › fairness
fair training |
0.4 | 1 | 2020 | FairALM: Augmented Lagrangian Method for Training Fair Models with Little Regret · ECCV (12) 2020 |
Robotics › Robot navigation and mapping
coverage control |
0.2 | 1 | 2015 | Local policies for efficiently patrolling a triangulated region by a robot swarm · ICRA 2015 |
Knowledge, reasoning and agents › Multi-agent systems
swarm robotics |
0.2 | 1 | 2015 | Local policies for efficiently patrolling a triangulated region by a robot swarm · ICRA 2015 |
Knowledge, reasoning and agents › Multi-agent systems › multi-agent coordination
distributed coordination |
0.1 | 1 | 2015 | Local policies for efficiently patrolling a triangulated region by a robot swarm · ICRA 2015 |
Methods — techniques the papers use, named apart from their topics
maximum mean discrepancy · 0.5convex optimization · 0.5contrastive learning · 0.5regret minimization · 0.4augmented lagrangian method · 0.4distributed triangulation · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Learning Invariant Representations using Inverse Contrastive LossabstractLearning invariant representations is a critical first step in a number of machine learning tasks. A common approach is given by the so-called information bottleneck principle in which an application dependent function of mutual information is carefully chosen and optimized. Unfortunately, in practice, these functions are not suitable for optimization purposes since these losses are agnostic of the metric structure of the parameters of the model. In our paper, we introduce a class of losses for learning representations that are invariant to some extraneous variable of interest by inverting the class of contrastive losses, i.e., inverse contrastive loss (ICL). We show that if the extraneous variable is binary, then optimizing ICL is equivalent to optimizing a regularized MMD divergence. More generally, we also show that if we are provided a metric on the sample space, our formulation of ICL can be decomposed into a sum of convex functions of the given distance metric. Our experimental results indicate that models obtained by optimizing ICL achieve significantly better invariance to the extraneous variable for a fixed desired level of accuracy. In a variety of experimental settings, we show applicability of ICL for learning invariant representations for both continuous and discrete protected/extraneous variables. The project page with code is available at https://github.com/adityakumarakash/ICL Aditya Kumar Akash, Vishnu Suresh Lokhande, Sathya N. Ravi |
AAAI | 1 |
| 2020 | FairALM: Augmented Lagrangian Method for Training Fair Models with Little Regret
Vishnu Suresh Lokhande, Aditya Kumar Akash, Sathya N. Ravi |
ECCV (12) | 2 |
| 2015 | Local policies for efficiently patrolling a triangulated region by a robot swarmabstractWe present and analyze methods for patrolling and surveillance in an environment with a distributed swarm of robots with limited capabilities. Our approach is based on a distributed triangulation of the work space, in which a set of p stationary sensors provides coverage control; in addition, there are r mobile robots that can move between the sensors. Building on our prior work on structured exploration of unknown spaces with multi-robot systems, we can make use of a triangulation that is constructed in a distributed fashion and guarantees good local navigation properties, even when sensors and robots have very limited capabilities. Daniela Maftuleac, SeoungKyou Lee, Sándor P. Fekete, Aditya Kumar Akash, Alejandro López-Ortiz, James McLurkin |
ICRA | 4 |