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

Akshaj Kumar Veldanda

dblp:259/1063 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0003-2330-2848ORCID · reported

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

Artificial intelligence and machine learning · 2 · 1 since 2021Systems, architecture and hardware · 1 · 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
2 papers
Robot navigation and mapping · 45% Motion planning and robot control · 35% Efficient and distributed learning · 20%
Network and information security
1 paper
Privacy and data protection · 50% Cryptographic protocols and secure computation · 50%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › motion planning › motion planning under uncertainty
belief space planning
0.712023
Path Planning Under Uncertainty to Localize mmWave Sources · ICRA 2023
Robotics › Robot navigation and mapping
localization
0.712023
Path Planning Under Uncertainty to Localize mmWave Sources · ICRA 2023
Robotics › Motion planning and robot control
path planning
0.712023
Path Planning Under Uncertainty to Localize mmWave Sources · ICRA 2023
Robotics › Robot navigation and mapping
source localization
0.712023
Path Planning Under Uncertainty to Localize mmWave Sources · ICRA 2023
Robotics › Robot navigation and mapping › mobile robot navigation › navigation planning
uncertainty-aware path planning
0.712023
Path Planning Under Uncertainty to Localize mmWave Sources · ICRA 2023
Machine learning › Efficient and distributed learning › automated machine learning › neural architecture search
latency-aware architecture search
0.412020
CryptoNAS: Private Inference on a ReLU Budget · NeurIPS 2020
Machine learning › Efficient and distributed learning › automated machine learning
neural architecture search
0.412020
CryptoNAS: Private Inference on a ReLU Budget · NeurIPS 2020
Privacy and data protection
privacy-preserving machine learning
0.412020
CryptoNAS: Private Inference on a ReLU Budget · NeurIPS 2020
Cryptographic protocols and secure computation
secure inference
0.412020
CryptoNAS: Private Inference on a ReLU Budget · NeurIPS 2020
Robotics › Motion planning and robot control › motion planning
motion planning in cluttered environments
0.212023
Path Planning Under Uncertainty to Localize mmWave Sources · ICRA 2023

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

neural architecture search · 0.9ReLU budget · 0.9iLQR · 0.7extended kalman filter · 0.7belief-space dynamics · 0.7
YearPublicationVenuePosition
2023 Path Planning Under Uncertainty to Localize mmWave Sources
abstract
In this paper, we study a navigation problem where a mobile robot needs to locate a mmWave wireless signal. Using the directionality properties of the signal, we propose an estimation and path planning algorithm that can efficiently navigate in cluttered indoor environments. We formulate Extended Kalman filters for emitter location estimation in cases where the signal is received in line-of-sight or after reflections. We then propose to plan motion trajectories based on belief-space dynamics in order to minimize the uncertainty of the position estimates. The associated non-linear optimization problem is solved by a state-of-the-art constrained iLQR solver. In particular, we propose a method that can handle a large number of obstacles (∼ 300) with reasonable computation times. We validate the approach in an extensive set of simulations. We show that our estimators can help increase navigation success rate and that planning to reduce estimation uncertainty can improve the overall task completion speed.
Kai Pfeiffer, Yuze Jia, Mingsheng Yin, Akshaj Kumar Veldanda, Yaqi Hu, Amee Trivedi, Jeff Zhang 0001, Siddharth Garg, Elza Erkip, Sundeep Rangan, Ludovic Righetti
ICRA4
2020 CryptoNAS: Private Inference on a ReLU Budget
abstract
Machine learning as a service has given raise to privacy concerns surrounding clients' data and providers' models and has catalyzed research in private inference (PI): methods to process inferences without disclosing inputs. Recently, researchers have adapted cryptographic techniques to show PI is possible, however all solutions increase inference latency beyond practical limits. This paper makes the observation that existing models are ill-suited for PI and proposes a novel NAS method, named CryptoNAS, for finding and tailoring models to the needs of PI. The key insight is that in PI operator latency cost are inverted: non-linear operations (e.g., ReLU) dominate latency, while linear layers become effectively free. We develop the idea of a ReLU budget as a proxy for inference latency and use CryptoNAS to build models that maximize accuracy within a given budget. CryptoNAS improves accuracy by 3.4% and latency by 2.4x over the state-of-the-art.
Zahra Ghodsi, Akshaj Kumar Veldanda, Brandon Reagen, Siddharth Garg
NeurIPS2