Demo Data from EDBT 2026 / reviewers in the wild / expert
Carmel Rabinovitz
dblp:226/2056
· DBLP profile ↗
6ranked-venue papers
1as first author
2since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3Systems, architecture and hardware · 1 · 1 first-author · 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
2 papers |
Planning, search and constraint satisfaction · 57% Motion planning and robot control · 12% Generative modeling · 12% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
bayesian planning |
0.8 | 1 | 2024 | A Bayesian Approach to Online Planning · ICML 2024 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › game tree search
monte carlo tree search |
0.8 | 1 | 2024 | A Bayesian Approach to Online Planning · ICML 2024 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning
online planning |
0.8 | 1 | 2024 | A Bayesian Approach to Online Planning · ICML 2024 |
Machine learning › Representation and self-supervised learning
contrastive learning |
0.5 | 1 | 2021 | Unsupervised Feature Learning for Manipulation with Contrastive Domain Randomization · ICRA 2021 |
Machine learning › Generative modeling
image manipulation |
0.5 | 1 | 2021 | Unsupervised Feature Learning for Manipulation with Contrastive Domain Randomization · ICRA 2021 |
Robotics › Motion planning and robot control
robot learning |
0.5 | 1 | 2021 | Unsupervised Feature Learning for Manipulation with Contrastive Domain Randomization · ICRA 2021 |
Machine learning › Reinforcement learning
thompson sampling |
0.2 | 1 | 2024 | A Bayesian Approach to Online Planning · ICML 2024 |
Methods — techniques the papers use, named apart from their topics
uncertainty quantification · 0.8thompson sampling · 0.8Bayes-UCB · 0.8simulation-to-real transfer · 0.5domain randomization · 0.5contrastive estimation · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | A Bayesian Approach to Online PlanningabstractThe combination of Monte Carlo tree search and neural networks has revolutionized online planning. As neural network approximations are often imperfect, we ask whether uncertainty estimates about the network outputs could be used to improve planning. We develop a Bayesian planning approach that facilitates such uncertainty quantification, inspired by classical ideas from the meta-reasoning literature. We propose a Thompson sampling based algorithm for searching the tree of possible actions, for which we prove the first (to our knowledge) finite time Bayesian regret bound, and propose an efficient implementation for a restricted family of posterior distributions. In addition we propose a variant of the Bayes-UCB method applied to trees. Empirically, we demonstrate that on the ProcGen Maze and Leaper environments, when the uncertainty estimates are accurate but the neural network output is inaccurate, our Bayesian approach searches the tree much more effectively. In addition, we investigate whether popular uncertainty estimation methods are accurate enough to yield significant gains in planning. Nir Greshler, David Ben-Eli, Carmel Rabinovitz, Gabi Guetta, Liran Gispan, Guy Zohar, Aviv Tamar |
ICML | 3 |
| 2021 | Unsupervised Feature Learning for Manipulation with Contrastive Domain RandomizationabstractRobotic tasks such as manipulation with visual inputs require image features that capture the physical properties of the scene, e.g., the position and configuration of objects. Recently, it has been suggested to learn such features in an unsupervised manner from simulated, self-supervised, robot interaction; the idea being that high-level physical properties are well captured by modern physical simulators, and their representation from visual inputs may transfer well to the real world. In particular, learning methods based on noise contrastive estimation have shown promising results. To robustify the simulation-to-real transfer, domain randomization (DR) was suggested for learning features that are invariant to irrelevant visual properties such as textures or lighting. In this work, however, we show that a naive application of DR to unsupervised learning based on contrastive estimation does not promote invariance, as the loss function maximizes mutual information between the features and both the relevant and irrelevant visual properties. We propose a simple modification of the contrastive loss to fix this, exploiting the fact that we can control the simulated randomization of visual properties. Our approach learns physical features that are significantly more robust to visual domain variation, as we demonstrate using both rigid and non-rigid objects. Carmel Rabinovitz, Niko A. Grupen, Aviv Tamar |
ICRA | 1 |
| 2020 | PERL: Pivot-based Domain Adaptation for Pre-trained Deep Contextualized Embedding ModelsabstractPivot-based neural representation models have led to significant progress in domain adaptation for NLP. However, previous research following this approach utilize only labeled data from the source domain and unlabeled data from the source and target domains, but neglect to incorporate massive unlabeled corpora that are not necessarily drawn from these domains. To alleviate this, we propose PERL: A representation learning model that extends contextualized word embedding models such as BERT (Devlin et al., 2019 ) with pivot-based fine-tuning. PERL outperforms strong baselines across 22 sentiment classification domain adaptation setups, improves in-domain model performance, yields effective reduced-size models, and increases model stability.1 Eyal Ben-David, Carmel Rabinovitz, Roi Reichart |
Trans. Assoc. Comput. Linguistics | 2 |
| 2019 | High Quality, Lightweight and Adaptable TTS Using LPCNetabstractWe present a lightweight adaptable neural TTS system with high quality output. The system is composed of three separate neural network blocks: prosody prediction, acoustic feature prediction and Linear Prediction Coding Net as a neural vocoder. This system can synthesize speech with close to natural quality while running 3 times faster than real-time on a standard CPU. The modular setup of the system allows for simple adaptation to new voices with a small amount of data. We first demonstrate the ability of the system to produce high quality speech when trained on large, high quality datasets. Following that, we demonstrate its adaptability by mimicking unseen voices using 5 to 20 minutes long datasets with lower recording quality. Large scale Mean Opinion Score quality and similarity tests are presented, showing that the system can adapt to unseen voices with quality gap of 0.12 and similarity gap of 3% compared to natural speech for male voices and quality gap of 0.35 and similarity of gap of 9 % for female voices. Zvi Kons, Slava Shechtman, Alexander Sorin, Carmel Rabinovitz, Ron Hoory |
INTERSPEECH | 4 |
| 2018 | The IBM Virtual Voice Creator
Alexander Sorin, Slava Shechtman, Zvi Kons, Ron Hoory, Shay Ben-David, Joe Pavitt, Shai Rozenberg, Carmel Rabinovitz, Tal Drory |
INTERSPEECH | 8 |
| 2018 | Neural TTS Voice ConversionabstractRecently, speaker adaptation of neural TTS models received significant interest, and several studies focusing on this topic have been published. All of them explore an adaptation of an initial multi-speaker model trained on a corpus containing from tens to hundreds of individual speaker voices.In this work we focus on a challenging task of TTS voice conversion where an initial system is trained on a single-speaker data and then need to be adapted to a variety of external speaker voices. The TTS voice conversion setup represents a very important use case. Transcribed multi-speaker datasets might be unavailable for many languages while any TTS technology provider is expected to have at least one suitable single-speaker dataset per supported language.We present a neural TTS system comprising separate prosody generator and synthesizer DNN models. The system is trained on a high quality proprietary male speaker dataset. We show that the system models can be converted to a variety of external male and female ordinary voices and an extremely expressive artist's voice and present crowd-base subjective evaluation results. Zvi Kons, Slava Shechtman, Alexander Sorin, Ron Hoory, Carmel Rabinovitz, Edmilson da Silva Morais |
SLT | 5 |