Yash Satsangi

According to our database1, Yash Satsangi authored at least 17 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Ranking Distance Metric for Privacy Budget in Distributed Learning of Finite Embedding Data.
Proceedings of the Advances in Information Retrieval, 2024

Absolute Variation Distance: An Inversion Attack Evaluation Metric for Federated Learning.
Proceedings of the Advances in Information Retrieval, 2024

2023
An Unsupervised Method for Estimating Class Separability of Datasets with Application to LLMs Fine-Tuning.
CoRR, 2023

Bandit-Based Policy Invariant Explicit Shaping for Incorporating External Advice in Reinforcement Learning.
CoRR, 2023

2022
Policy invariant explicit shaping: an efficient alternative to reward shaping.
Neural Comput. Appl., 2022

Topical: Learning Repository Embeddings from Source Code using Attention.
CoRR, 2022

Ledgit: A Service to Diagnose Illicit Addresses on Blockchain using Multi-modal Unsupervised Learning.
Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022

2021
Learning to Be Cautious.
CoRR, 2021

2020
Useful Policy Invariant Shaping from Arbitrary Advice.
CoRR, 2020

Maximizing Information Gain in Partially Observable Environments via Prediction Reward.
CoRR, 2020

Maximizing Information Gain in Partially Observable Environments via Prediction Rewards.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2018
Exploiting submodular value functions for scaling up active perception.
Auton. Robots, 2018

2017
Real-Time Resource Allocation for Tracking Systems.
Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, 2017

2016
Probably Approximately Correct Greedy Maximization.
CoRR, 2016

PAC Greedy Maximization with Efficient Bounds on Information Gain for Sensor Selection.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Probably Approximately Correct Greedy Maximization: (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015
Exploiting Submodular Value Functions for Faster Dynamic Sensor Selection.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015


  Loading...