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

Sohom Mukherjee

dblp:227/2545 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2023
0000-0003-0085-1203ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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
Efficient and distributed learning · 75% Learning theory · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
model compression
0.712023
Why Random Pruning Is All We Need to Start Sparse · ICML 2023
Machine learning › Learning theory
over-parameterization
0.712023
Why Random Pruning Is All We Need to Start Sparse · ICML 2023
Machine learning › Efficient and distributed learning › model compression
pruning
0.712023
Why Random Pruning Is All We Need to Start Sparse · ICML 2023
Machine learning › Efficient and distributed learning › model compression
sparse neural network
0.712023
Why Random Pruning Is All We Need to Start Sparse · ICML 2023

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

lottery ticket hypothesis · 0.7
YearPublicationVenuePosition
2023 Why Random Pruning Is All We Need to Start Sparse
abstract
Random masks define surprisingly effective sparse neural network models, as has been shown empirically. The resulting sparse networks can often compete with dense architectures and state-of-the-art lottery ticket pruning algorithms, even though they do not rely on computationally expensive prune-train iterations and can be drawn initially without significant computational overhead. We offer a theoretical explanation of how random masks can approximate arbitrary target networks if they are wider by a logarithmic factor in the inverse sparsity $1 / \log(1/\text{sparsity})$. This overparameterization factor is necessary at least for 3-layer random networks, which elucidates the observed degrading performance of random networks at higher sparsity. At moderate to high sparsity levels, however, our results imply that sparser networks are contained within random source networks so that any dense-to-sparse training scheme can be turned into a computationally more efficient sparse-to-sparse one by constraining the search to a fixed random mask. We demonstrate the feasibility of this approach in experiments for different pruning methods and propose particularly effective choices of initial layer-wise sparsity ratios of the random source network. As a special case, we show theoretically and experimentally that random source networks also contain strong lottery tickets.
Advait Gadhikar, Sohom Mukherjee, Rebekka Burkholz
ICML2
2019 Fault Classification in Three Phase Self-Excited Induction Generators using Deep Neural Networks
abstract
In this paper, an algorithm is proposed for the classification of faults in three phase self-excited induction generators using deep neural networks, on the basis of their voltage and current waveforms. Three phase self-exited induction generators, which are mostly used in wind power stations, are often connected to the national grid. Therefore, the transient stability analysis of this machine, prior and post symmetrical and unsymmetrical short circuit faults is one of the main concerns in power system security and operation. In this study, voltage and current waveforms of faults have been simulated in the Simulink environment, for different conditions of fault. Following this, visual time-frequency representations of the fault signals called scalograms are created, using continuous wavelet transform. Finally, a deep convolutional neural network is used for classification of the fault signals. Experimental results show that a final accuracy of 82.14% as well as real-time inference is achieved on the validation set, using the proposed scheme.
Sohom Mukherjee, Arindam Dutta, Saradindu Ghosh
TENCON1
2019 Fingertip detection and tracking for recognition of air-writing in videos
Sohom Mukherjee, Arif Ahmed 0002, Debi Prosad Dogra, Samarjit Kar, Partha Pratim Roy 0001
Expert Syst. Appl.1