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

Pouria Mahdavinia

dblp:331/5410 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 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
Efficient and distributed learning · 56% Optimization for machine learning · 38% Learning theory · 6%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
distributed training
0.712023
Distributed Personalized Empirical Risk Minimization · NeurIPS 2023
Machine learning › Efficient and distributed learning
federated learning
0.712023
Distributed Personalized Empirical Risk Minimization · NeurIPS 2023
Machine learning › Efficient and distributed learning › federated learning
personalized federated learning
0.712023
Distributed Personalized Empirical Risk Minimization · NeurIPS 2023
Machine learning › Optimization for machine learning › minimax optimization
gradient descent ascent
0.612022
Tight Analysis of Extra-gradient and Optimistic Gradient Methods For Nonconvex Minimax Problems · NeurIPS 2022
Machine learning › Optimization for machine learning
minimax optimization
0.612022
Tight Analysis of Extra-gradient and Optimistic Gradient Methods For Nonconvex Minimax Problems · NeurIPS 2022
Machine learning › Optimization for machine learning
convergence analysis
0.212023
Distributed Personalized Empirical Risk Minimization · NeurIPS 2023
Machine learning › Learning theory
statistical learning theory
0.212023
Distributed Personalized Empirical Risk Minimization · NeurIPS 2023

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

convergence analysis · 1.2model shuffling · 0.7empirical risk minimization · 0.7lower bounds · 0.6
YearPublicationVenuePosition
2023 Distributed Personalized Empirical Risk Minimization
abstract
This paper advocates a new paradigm Personalized Empirical Risk Minimization (PERM) to facilitate learning from heterogeneous data sources without imposing stringent constraints on computational resources shared by participating devices. In PERM, we aim at learning a distinct model for each client by personalizing the aggregation of local empirical losses by effectively estimating the statistical discrepancy among data distributions, which entails optimal statistical accuracy for all local distributions and overcomes the data heterogeneity issue. To learn personalized models at scale, we propose a distributed algorithm that replaces the standard model averaging with model shuffling to simultaneously optimize PERM objectives for all devices. This also allows to learn distinct model architectures (e.g., neural networks with different number of parameters) for different clients, thus confining to underlying memory and compute resources of individual clients. We rigorously analyze the convergence of proposed algorithm and conduct experiments that corroborates the effectiveness of proposed paradigm.
Yuyang Deng, Mohammad Mahdi Kamani, Pouria Mahdavinia, Mehrdad Mahdavi
NeurIPS3
2022 Tight Analysis of Extra-gradient and Optimistic Gradient Methods For Nonconvex Minimax Problems
abstract
Despite the established convergence theory of Optimistic Gradient Descent Ascent (OGDA) and Extragradient (EG) methods for the convex-concave minimax problems, little is known about the theoretical guarantees of these methods in nonconvex settings. To bridge this gap, for the first time, this paper establishes the convergence of OGDA and EG methods under the nonconvex-strongly-concave (NC-SC) and nonconvex-concave (NC-C) settings by providing a unified analysis through the lens of single-call extra-gradient methods. We further establish lower bounds on the convergence of GDA/OGDA/EG, shedding light on the tightness of our analysis. We also conduct experiments supporting our theoretical results. We believe our results will advance the theoretical understanding of OGDA and EG methods for solving complicated nonconvex minimax real-world problems, e.g., Generative Adversarial Networks (GANs) or robust neural networks training.
Pouria Mahdavinia, Yuyang Deng, Haochuan Li, Mehrdad Mahdavi
NeurIPS1