Demo Data from EDBT 2026 / reviewers in the wild / expert
Tejas Jayashankar
dblp:254/7950
· DBLP profile ↗
6ranked-venue papers
6as first author
4since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 4 · 4 first-author · 2 since 2021Artificial intelligence and machine learning · 3 · 3 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 |
Generative modeling · 94% Probabilistic and Bayesian machine learning · 6% | |
| Computer graphics and multimedia
1 paper |
Audio and music processing · 100% | |
| Computer networks
1 paper |
Physical-layer communications · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling
diffusion model |
1.5 | 2 | 2025 | Score-of-Mixture Training: One-Step Generative Model Training Made Simple via Score Estimation of Mixture Distributions · ICML 2025 Score-based Source Separation with Applications to Digital Communication Signals · NeurIPS 2023 |
Machine learning › Generative modeling › diffusion model
score distillation sampling |
0.9 | 1 | 2025 | Score-of-Mixture Training: One-Step Generative Model Training Made Simple via Score Estimation of Mixture Distributions · ICML 2025 |
Machine learning › Generative modeling › diffusion model
score-based generative model |
0.7 | 1 | 2023 | Score-based Source Separation with Applications to Digital Communication Signals · NeurIPS 2023 |
Audio and music processing
source separation |
0.7 | 1 | 2023 | Score-based Source Separation with Applications to Digital Communication Signals · NeurIPS 2023 |
Machine learning › Probabilistic and Bayesian machine learning
divergence minimization |
0.3 | 1 | 2025 | Score-of-Mixture Training: One-Step Generative Model Training Made Simple via Score Estimation of Mixture Distributions · ICML 2025 |
Physical-layer communications
signal processing for communications |
0.2 | 1 | 2023 | Score-based Source Separation with Applications to Digital Communication Signals · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
score distillation sampling · 2.0maximum a posteriori estimation · 2.0diffusion model · 2.0score matching · 0.9consistency distillation · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Score-of-Mixture Training: One-Step Generative Model Training Made Simple via Score Estimation of Mixture DistributionsabstractWe propose *Score-of-Mixture Training* (SMT), a novel framework for training one-step generative models by minimizing a class of divergences called the
$\alpha$-skew Jensen–Shannon divergence. At its core, SMT estimates the score of mixture distributions between real and fake samples across multiple noise levels.
Similar to consistency models, our approach supports both training from scratch (SMT) and distillation using a pretrained diffusion model, which we call *Score-of-Mixture Distillation* (SMD).
It is simple to implement, requires minimal hyperparameter tuning, and ensures stable training. Experiments on CIFAR-10 and ImageNet 64×64 show that SMT/SMD are competitive with and can even outperform existing methods. Tejas Jayashankar, Jongha Jon Ryu, Gregory W. Wornell |
ICML | 1 |
| 2023 | Self-Supervised Representations for Singing Voice ConversionabstractA singing voice conversion model converts a song in the voice of an arbitrary source singer to the voice of a target singer. Recently, methods that leverage self-supervised audio representations such as HuBERT and Wav2Vec 2.0 have helped further the state-of-the-art. Though these methods produce more natural and melodic singing outputs, they often rely on confusion and disentanglement losses to render the self-supervised representations speaker and pitch-invariant. In this paper, we circumvent disentanglement training and propose a new model that leverages ASR fine-tuned self-supervised representations as inputs to a HiFi-GAN neural vocoder for singing voice conversion. We experiment with different f0encoding schemes and show that an f0harmonic generation module that uses a parallel bank of transposed convolutions (PBTC) alongside ASR fine-tuned Wav2Vec 2.0 features results in the best singing voice conversion quality. Additionally, the model is capable of making a spoken voice sing. We also show that a simple f0shifting scheme during inference helps retain singer identity and bolsters the performance of our singing voice conversion model. Our results are backed up by extensive MOS studies that compare different ablations and baselines. Tejas Jayashankar, Jilong Wu, Leda Sari, David Kant, Vimal Manohar |
ICASSP | 1 |
| 2023 | Score-based Source Separation with Applications to Digital Communication SignalsabstractWe propose a new method for separating superimposed sources using diffusion-based generative models. Our method relies only on separately trained statistical priors of independent sources to establish a new objective function guided by $\textit{maximum a posteriori}$ estimation with an $\textit{$\alpha$-posterior}$, across multiple levels of Gaussian smoothing. Motivated by applications in radio-frequency (RF) systems, we are interested in sources with underlying discrete nature and the recovery of encoded bits from a signal of interest, as measured by the bit error rate (BER). Experimental results with RF mixtures demonstrate that our method results in a BER reduction of 95\% over classical and existing learning-based methods. Our analysis demonstrates that our proposed method yields solutions that asymptotically approach the modes of an underlying discrete distribution. Furthermore, our method can be viewed as a multi-source extension to the recently proposed score distillation sampling scheme, shedding additional light on its use beyond conditional sampling. The project webpage is available at https://alpha-rgs.github.io. Tejas Jayashankar, Gary C. F. Lee, Alejandro Lancho, Amir Weiss, Yury Polyanskiy, Gregory W. Wornell |
NeurIPS | 1 |
| 2022 | Architecture for Variable Bitrate Neural Speech Codec with Configurable Computation ComplexityabstractLow bitrate speech codecs have become an area of intense research. Traditional speech codecs, which use signal processing methods to encode and decode speech, often suffer from quality issues at low bitrates. A neural speech codec, which uses a deep neural network in the compression pipeline, can help alleviate this issue. In this paper we present a new neural speech codec that: 1) supports variable bitrates 2) supports packet losses of up to 120 ms and 3) can operate at low-compute and high-compute modes. Our codec uses a hierarchical VQ-VAE (HVQVAE) for encoding and decoding spectral features at different bitrates. The decoded features are fed to a vocoder for speech synthesis. Depending upon the end user’s computing resources, the decoder either uses a powerful WaveRNN or a parametric vocoder for speech synthesis. Our experiments demonstrate that our HVQVAE + WaveRNN setup achieves high audio quality. Tejas Jayashankar, Thilo Köhler, Kaustubh Kalgaonkar, Zhiping Xiu, Jilong Wu, Ju Lin, Prabhav Agrawal |
ICASSP | 1 |
| 2020 | Detecting Audio Attacks on ASR Systems with Dropout UncertaintyabstractVarious adversarial audio attacks have recently been developed to fool automatic speech recognition (ASR) systems. We here propose a defense against such attacks based on the uncertainty introduced by dropout in neural networks. We show that our defense is able to detect attacks created through optimized perturbations and frequency masking on a state-of-the-art end-to-end ASR system. Furthermore, the defense can be made robust against attacks that are immune to noise reduction. We test our defense on Mozilla's CommonVoice dataset, the UrbanSound dataset, and an excerpt of the LibriSpeech dataset, showing that it achieves high detection accuracy in a wide range of scenarios. Tejas Jayashankar, Jonathan Le Roux, Pierre Moulin |
INTERSPEECH | 1 |
| 2019 | Lap-Based Video Frame InterpolationabstractHigh-quality video frame interpolation often necessitates accurate motion estimation, which can be obtained using modern optical flow methods. In this paper, we use the recently proposed Local All-Pass (LAP) algorithm to compute the optical flow between two consecutive frames. The resulting flow field is used to perform interpolation using cubic splines. We compare the interpolation results against a well-known optical flow estimation algorithm as well as against a recent con-volutional neural network scheme for video frame interpolation. Qualitative and quantitative results show that the LAP algorithm performs fast, high-quality video frame interpolation, and perceptually outperforms the neural network and the Lucas-Kanade method on a variety of test sequences. Tejas Jayashankar, Pierre Moulin, Thierry Blu, Christopher Gilliam |
ICIP | 1 |