Search Results for author: Jimit Majmudar

Found 7 papers, 1 papers with code

Partial Federated Learning

no code implementations3 Mar 2024 Tiantian Feng, Anil Ramakrishna, Jimit Majmudar, Charith Peris, Jixuan Wang, Clement Chung, Richard Zemel, Morteza Ziyadi, Rahul Gupta

Federated Learning (FL) is a popular algorithm to train machine learning models on user data constrained to edge devices (for example, mobile phones) due to privacy concerns.

Contrastive Learning Federated Learning

Coordinated Replay Sample Selection for Continual Federated Learning

no code implementations23 Oct 2023 Jack Good, Jimit Majmudar, Christophe Dupuy, Jixuan Wang, Charith Peris, Clement Chung, Richard Zemel, Rahul Gupta

Continual Federated Learning (CFL) combines Federated Learning (FL), the decentralized learning of a central model on a number of client devices that may not communicate their data, and Continual Learning (CL), the learning of a model from a continual stream of data without keeping the entire history.

Continual Learning Federated Learning

Differentially Private Decoding in Large Language Models

no code implementations26 May 2022 Jimit Majmudar, Christophe Dupuy, Charith Peris, Sami Smaili, Rahul Gupta, Richard Zemel

Recent large-scale natural language processing (NLP) systems use a pre-trained Large Language Model (LLM) on massive and diverse corpora as a headstart.

Language Modelling Large Language Model +1

Federated Learning with Noisy User Feedback

no code implementations NAACL 2022 Rahul Sharma, Anil Ramakrishna, Ansel MacLaughlin, Anna Rumshisky, Jimit Majmudar, Clement Chung, Salman Avestimehr, Rahul Gupta

Federated learning (FL) has recently emerged as a method for training ML models on edge devices using sensitive user data and is seen as a way to mitigate concerns over data privacy.

Federated Learning text-classification +1

Robust Correlation Clustering with Asymmetric Noise

no code implementations15 Oct 2021 Jimit Majmudar, Stephen Vavasis

Graph clustering problems typically aim to partition the graph nodes such that two nodes belong to the same partition set if and only if they are similar.

Clustering Combinatorial Optimization +1

Provable Overlapping Community Detection in Weighted Graphs

no code implementations NeurIPS 2020 Jimit Majmudar, Stephen Vavasis

When the communities are allowed to overlap, often a pure nodes assumption is made, i. e. each community has a node that belongs exclusively to that community.

Community Detection

Cannot find the paper you are looking for? You can Submit a new open access paper.