Abhishek Singh 0005

dblp:27/2328-5 · DBLP profile ↗
← Back
8ranked-venue papers
5as first author
8since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 8 · 5 first-author · 8 since 2021Graphics, computer vision, multimedia, augmented reality and games · 7 · 4 first-author · 7 since 2021
YearPublicationVenuePosition
2025 Co-Dream: Collaborative Dream Synthesis over Decentralized Models
abstract
Federated Learning (FL) has pioneered the idea of "share wisdom not raw data" to enable collaborative learning over decentralized data. FL achieves this goal by averaging model parameters instead of centralizing data. However, representing "wisdom" in the form of model parameters has its own limitations including the requirement for uniform model architectures across clients and communication overhead proportional to model size. In this work we introduce Co-Dream a framework for representing "wisdom" in data space instead of model parameters. Here, clients collaboratively optimize random inputs based on their locally trained models and aggregate gradients of their inputs. Our proposed approach overcomes the aforementioned limitations and comes with additional benefits such as adaptive optimization and interpretable representation of knowledge. We empirically demonstrate the effectiveness of Co-Dream and compare its performance with existing techniques.
Abhishek Singh 0005, Gauri Gupta, Yichuan Shi, Alex Dang, Ritvik Kapila, Sheshank Shankar, Mohammed Ehab, Ramesh Raskar
AAAI1
2024 SIMBA: Split Inference - Mechanisms, Benchmarks and Attacks
Abhishek Singh 0005, Vivek Sharma 0001, Rohan Sukumaran, John Mose, Jeffrey Chiu, Justin Yu, Ramesh Raskar
ECCV (76)1
2024 DecentNeRFs: Decentralized Neural Radiance Fields from Crowdsourced Images
Zaid Tasneem, Akshat Dave, Abhishek Singh 0005, Kushagra Tiwary, Praneeth Vepakomma, Ashok Veeraraghavan, Ramesh Raskar
ECCV (59)3
2023 Posthoc privacy guarantees for collaborative inference with modified Propose-Test-Release
abstract
Cloud-based machine learning inference is an emerging paradigm where users query by sending their data through a service provider who runs an ML model on that data and returns back the answer. Due to increased concerns over data privacy, recent works have proposed Collaborative Inference (CI) to learn a privacy-preserving encoding of sensitive user data before it is shared with an untrusted service provider. Existing works so far evaluate the privacy of these encodings through empirical reconstruction attacks. In this work, we develop a new framework that provides formal privacy guarantees for an arbitrarily trained neural network by linking its local Lipschitz constant with its local sensitivity. To guarantee privacy using local sensitivity, we extend the Propose-Test-Release (PTR) framework to make it tractable for neural network queries. We verify the efficacy of our framework experimentally on real-world datasets and elucidate the role of Adversarial Representation Learning (ARL) in improving the privacy-utility trade-off.
Abhishek Singh 0005, Praneeth Vepakomma, Vivek Sharma 0001, Ramesh Raskar
NeurIPS1
2022 Learning to Censor by Noisy Sampling
Ayush Chopra, Abhinav Java, Abhishek Singh 0005, Vivek Sharma 0001, Ramesh Raskar
ECCV (13)3
2022 Decouple-and-Sample: Protecting Sensitive Information in Task Agnostic Data Release
Abhishek Singh 0005, Ethan Garza, Ayush Chopra, Praneeth Vepakomma, Vivek Sharma 0001, Ramesh Raskar
ECCV (13)1
2021 DISCO: Dynamic and Invariant Sensitive Channel Obfuscation for Deep Neural Networks
abstract
Recent deep learning models have shown remarkable performance in image classification. While these deep learning systems are getting closer to practical deployment, the common assumption made about data is that it does not carry any sensitive information. This assumption may not hold for many practical cases, especially in the domain where an individual’s personal information is involved, like healthcare and facial recognition systems. We posit that selectively removing features in this latent space can protect the sensitive information and provide better privacy-utility trade-off. Consequently, we propose DISCO which learns a dynamic and data driven pruning filter to selectively obfuscate sensitive information in the feature space. We propose diverse attack schemes for sensitive inputs & attributes and demonstrate the effectiveness of DISCO against state-of-the-art methods through quantitative and qualitative evaluation. Finally, we also release an evaluation benchmark dataset of 1 million sensitive representations to encourage rigorous exploration of novel attack and defense schemes at https://github.com/splitlearning/InferenceBenchmark.
Abhishek Singh 0005, Ayush Chopra, Ethan Garza, Emily Zhang, Praneeth Vepakomma, Vivek Sharma 0001, Ramesh Raskar
CVPR1
2021 NoPeek-Infer: Preventing face reconstruction attacks in distributed inference after on-premise training
abstract
For models trained on-premise but deployed in a distributed fashion across multiple entities, we demonstrate that minimizing distance correlation between sensitive data such as faces and intermediary representations enables prediction while preventing reconstruction attacks. Leakage (measured using distance correlation between input and intermediate representations) is the risk associated with the reconstruction of raw face data from intermediary representations that are communicated in a distributed setting. We demonstrate on face datasets that our method is resilient to reconstruction attacks during distributed inference while maintaining information required to sustain good classification accuracy. We share modular code for performing NoPeek-Infer at http://tiny.cc/nopeek along with corresponding trained models for benchmarking attack techniques.
Praneeth Vepakomma, Abhishek Singh 0005, Emily Zhang, Otkrist Gupta, Ramesh Raskar
FG2