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

Rohan Panda

dblp:278/4337 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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
1 paper
Optimization for machine learning · 67% Efficient and distributed learning · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
federated learning
0.612022
Federated Minimax Optimization: Improved Convergence Analyses and Algorithms · ICML 2022
Machine learning › Optimization for machine learning › minimax optimization
federated minimax optimization
0.612022
Federated Minimax Optimization: Improved Convergence Analyses and Algorithms · ICML 2022
Machine learning › Optimization for machine learning
minimax optimization
0.612022
Federated Minimax Optimization: Improved Convergence Analyses and Algorithms · ICML 2022

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

stochastic gradient descent ascent · 0.6momentum-based method · 0.6local-update algorithm · 0.6
YearPublicationVenuePosition
2022 Federated Minimax Optimization: Improved Convergence Analyses and Algorithms
abstract
In this paper, we consider nonconvex minimax optimization, which is gaining prominence in many modern machine learning applications, such as GANs. Large-scale edge-based collection of training data in these applications calls for communication-efficient distributed optimization algorithms, such as those used in federated learning, to process the data. In this paper, we analyze local stochastic gradient descent ascent (SGDA), the local-update version of the SGDA algorithm. SGDA is the core algorithm used in minimax optimization, but it is not well-understood in a distributed setting. We prove that Local SGDA has order-optimal sample complexity for several classes of nonconvex-concave and nonconvex-nonconcave minimax problems, and also enjoys linear speedup with respect to the number of clients. We provide a novel and tighter analysis, which improves the convergence and communication guarantees in the existing literature. For nonconvex-PL and nonconvex-one-point-concave functions, we improve the existing complexity results for centralized minimax problems. Furthermore, we propose a momentum-based local-update algorithm, which has the same convergence guarantees, but outperforms Local SGDA as demonstrated in our experiments.
Pranay Sharma, Rohan Panda, Gauri Joshi, Pramod K. Varshney
ICML2
2022 Investigating the Important Temporal Modulations for Deep-Learning-Based Speech Activity Detection
abstract
We describe a learnable modulation spectrogram feature for speech activity detection (SAD). Modulation features capture the temporal dynamics of each frequency subband. We compute learnable modulation spectrogram features by first calculating the log-mel spectrogram. Next, we filter each frequency subband with a bandpass filter that contains a learnable center frequency. The resulting SAD system was evaluated on the Fearless Steps Phase-04 SAD challenge. Experimental results showed that temporal modulations around the 4–6 Hz range are crucial for deep-learning-based SAD. These experimental results align with previous studies that found slow temporal modulation to be most important for speech-processing tasks and speech intelligibility. Additionally, we found that the learnable modulation spectrogram feature outperforms both the standard log-mel and fixed modulation spectrogram features on the Fearless Steps Phase-04 SAD test set.
Tyler Vuong, Nikhil Madaan, Rohan Panda, Richard M. Stern
SLT3