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

Y. Cem Sübakan

dblp:144/9964 · also Yusuf Cem Sübakan · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2020
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorArtificial intelligence and machine learning · 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
Probabilistic and Bayesian machine learning · 91% Representation and self-supervised learning · 9%
Theoretical computer science
1 paper
Algorithms and data structures · 50% Automata and formal languages · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
hidden markov model
0.212014
Spectral Learning of Mixture of Hidden Markov Models · NIPS 2014
Machine learning › Probabilistic and Bayesian machine learning › structured models
latent variable model
0.212014
Spectral Learning of Mixture of Hidden Markov Models · NIPS 2014
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model › hidden markov model
mixture of hidden markov models
0.212014
Spectral Learning of Mixture of Hidden Markov Models · NIPS 2014
Automata and formal languages › weighted automata
spectral learning
0.212014
Spectral Learning of Mixture of Hidden Markov Models · NIPS 2014
Algorithms and data structures
spectral methods
0.212014
Spectral Learning of Mixture of Hidden Markov Models · NIPS 2014

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

spectral learning · 0.4method of moments · 0.4
YearPublicationVenuePosition
2020 Two-Step Sound Source Separation: Training On Learned Latent Targets
abstract
In this paper, we propose a two-step training procedure for source separation via a deep neural network. In the first step we learn a transform (and it's inverse) to a latent space where masking-based separation performance using oracles is optimal. For the second step, we train a separation module that operates on the previously learned space. In order to do so, we also make use of a scale-invariant signal to distortion ratio (SI-SDR) loss function that works in the latent space, and we prove that it lower-bounds the SI-SDR in the time domain. We run various sound separation experiments that show how this approach can obtain better performance as compared to systems that learn the transform and the separation module jointly. The proposed methodology is general enough to be applicable to a large class of neural network end-to-end separation systems.
Efthymios Tzinis, Shrikant Venkataramani, Zhepei Wang, Y. Cem Sübakan, Paris Smaragdis
ICASSP4
2018 Generative Adversarial Source Separation
abstract
Generative source separation methods such as non-negative matrix factorization (NMF) or auto-encoders, rely on the assumption of an output probability density. Generative Adversarial Networks (GANs) can learn data distributions without needing a parametric assumption on the output density. We show on a speech source separation experiment that, a multilayer perceptron trained with a Wasserstein-GAN formulation outperforms NMF, auto-encoders trained with maximum likelihood, and variational auto-encoders in terms of source to distortion ratio.
Y. Cem Sübakan, Paris Smaragdis
ICASSP1
2014 Spectral Learning of Mixture of Hidden Markov Models
Y. Cem Sübakan, Johannes Traa, Paris Smaragdis
NIPS1