614,862 research outputs found
NOMAD: Non-locking, stOchastic Multi-machine algorithm for Asynchronous and Decentralized matrix completion
We develop an efficient parallel distributed algorithm for matrix completion,
named NOMAD (Non-locking, stOchastic Multi-machine algorithm for Asynchronous
and Decentralized matrix completion). NOMAD is a decentralized algorithm with
non-blocking communication between processors. One of the key features of NOMAD
is that the ownership of a variable is asynchronously transferred between
processors in a decentralized fashion. As a consequence it is a lock-free
parallel algorithm. In spite of being an asynchronous algorithm, the variable
updates of NOMAD are serializable, that is, there is an equivalent update
ordering in a serial implementation. NOMAD outperforms synchronous algorithms
which require explicit bulk synchronization after every iteration: our
extensive empirical evaluation shows that not only does our algorithm perform
well in distributed setting on commodity hardware, but also outperforms
state-of-the-art algorithms on a HPC cluster both in multi-core and distributed
memory settings
Move-optimal schedules for parallel machines to minimize total weighted completion time
We study the minimum total weighted completion time problem on identical machines, which is known to be strongly -hard. We analyze a simple local search heuristic, moving jobs from one machine to another. The local optima can be shown to be approximately optimal with approximation ratio . In case all jobs have equal Smith ratios, the approximation ratio is at most
Paradigm Completion for Derivational Morphology
The generation of complex derived word forms has been an overlooked problem
in NLP; we fill this gap by applying neural sequence-to-sequence models to the
task. We overview the theoretical motivation for a paradigmatic treatment of
derivational morphology, and introduce the task of derivational paradigm
completion as a parallel to inflectional paradigm completion. State-of-the-art
neural models, adapted from the inflection task, are able to learn a range of
derivation patterns, and outperform a non-neural baseline by 16.4%. However,
due to semantic, historical, and lexical considerations involved in
derivational morphology, future work will be needed to achieve performance
parity with inflection-generating systems.Comment: EMNLP 201
New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
In this paper, we are interested in parallel identical machine scheduling
problems with preemption and release dates in case of a regular criterion to be
minimized. We show that solutions having a permutation flow shop structure are
dominant if there exists an optimal solution with completion times scheduled in
the same order as the release dates, or if there is no release date. We also
prove that, for a subclass of these problems, the completion times of all jobs
can be ordered in an optimal solution. Using these two results, we provide new
results on polynomially solvable problems and hence refine the boundary between
P and NP for these problems
- …