Arrow Research search

Author name cluster

Amir Kantor

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
2 author rows

Possible papers

3

AAAI Conference 2020 Conference Paper

Do Not Have Enough Data? Deep Learning to the Rescue!

  • Ateret Anaby-Tavor
  • Boaz Carmeli
  • Esther Goldbraich
  • Amir Kantor
  • George Kour
  • Segev Shlomov
  • Naama Tepper
  • Naama Zwerdling

Based on recent advances in natural language modeling and those in text generation capabilities, we propose a novel data augmentation method for text classification tasks. We use a powerful pre-trained neural network model to artificially synthesize new labeled data for supervised learning. We mainly focus on cases with scarce labeled data. Our method, referred to as language-model-based data augmentation (LAM- BADA), involves fine-tuning a state-of-the-art language generator to a specific task through an initial training phase on the existing (usually small) labeled data. Using the fine-tuned model and given a class label, new sentences for the class are generated. Our process then filters these new sentences by using a classifier trained on the original data. In a series of experiments, we show that LAMBADA improves classi- fiers’ performance on a variety of datasets. Moreover, LAM- BADA significantly improves upon the state-of-the-art techniques for data augmentation, specifically those applicable to text classification tasks with little data.

LPAR Conference 2013 Conference Paper

Relaxing Synchronization Constraints in Behavioral Programs

  • David Harel
  • Amir Kantor
  • Guy Katz

Abstract In behavioral programming, a program consists of separate modules called behavior threads, each representing a part of the system’s allowed, necessary or forbidden behavior. An execution of the program is a series of synchronizations between these threads, where at each synchronization point an event is selected to be carried out. As a result, the execution speed is dictated by the slowest thread. We propose an eager execution mechanism for such programs, which builds upon the realization that it is often possible to predict the outcome of a synchronization point even without waiting for slower threads to synchronize. This allows faster threads to continue running uninterrupted, whereas slower ones catch up at a later time. Consequently, eager execution brings about increased system performance, better support for the modular design of programs, and the ability to distribute programs across several machines. It also allows to apply behavioral programming to a variety of problems that were previously outside its scope. We illustrate the method by concrete examples, implemented in a behavioral programming framework in C + +.

TCS Journal 2012 Journal Article

Multi-modal scenarios revisited: A net-based representation

  • David Harel
  • Amir Kantor

Live sequence charts (LSC) is a visual formalism that can be used to model reactive systems. In terms of LSC, a system model is a set of charts, each of which may be referred to as a multi-modal scenario. In this paper, we revisit the scenarios of the UML2-compliant dialect of LSC. We abstract from their concrete visual representation, and show how to capture multi-modal scenarios in a flexible, yet conservative, way. For this, we use the building blocks of Petri nets; i. e. , places and transitions, extended with modalities and interpreted in accordance with the semantics of LSC. This results in what we refer to as LSC nets. LSC nets can express a variety of advanced constructs of LSC, as well as several semantic variations suggested in the literature, with just a few primitive notions. At the same time, the net corresponding to an LSC involves rather superficial, technical, changes in presentation. As a result, LSC nets form a rigorous basis to present, discuss, and investigate the language as a whole, or interesting fragments thereof.

v2026.09.13