← Search

Mayank Kumar

4 accepted papers

2026

Adaptive Compute Efficient Learning via Conceptual-Criticality (Student Abstract)

AAAI 2026technical

The computational cost of large language models (LLMs) is a primary obstacle to sustainable deployment. Static resource allocation is inefficient, as not all inputs require the same depth of processing. We propose a framework for adaptive, compute-efficient learning via conceptual criticality, which

Cited by 0SourcePDFScholar
2026

FHAIM: Fully Homomorphic AIM for Private Synthetic Data Generation

ICML 2026poster

Data is the lifeblood of AI, yet much of the most valuable data remains locked in silos due to privacy and regulations. As a result, AI remains heavily underutilized in many of the most important domains, including healthcare, education, and finance. Synthetic data generation (SDG), i.e.~the generat…

Cited by 0SourceScholar
2026

FHE-Coder: Secure Agentic Code Generation for Fully Homomorphic Encryption

ICLR 2026poster

Fully Homomorphic Encryption (FHE) is a foundational technology for confidential computing, yet its practical adoption remains limited by the need for specialized cryptographic expertise and error-prone parameter configuration. To lower this barrier, we investigate whether Large Language Model (LLM)…

Cited by 0SourceScholar
2025

DictPFL: Efficient and Private Federated Learning on Encrypted Gradients

NeurIPS 2025poster

Federated Learning (FL) enables collaborative model training across institutions without sharing raw data. However, gradient sharing still risks privacy leakage, such as gradient inversion attacks. Homomorphic Encryption (HE) can secure aggregation but often incurs prohibitive computational and comm…

Cited by 0SourcecodeScholar