Automatic track mixing

By using state-of-the-art algorithms for beat tracking and structure analysis, our goal is to create a continuous flow of music with seamless transitions between tracks.

The objective is a fully automated mixing system with focus on electronic dance music.

Contact: Mickaël Zehren

Canonical Polyadic Tensor Decomposition

1. Algorithm 1026: Concurrent Alternating Least Squares for multiple simultaneous Canonical Polyadic Decompositions
   Christos Psarras, Lars Karlsson, Rasmus Bro and Paolo Bientinesi
   ACM Transactions on Mathematical Software, Volume 48(3), pp. 1-20, September 2022.

   @article{Psarras2022:980,
       author  = "Christos Psarras and Lars Karlsson and Rasmus Bro and Paolo Bientinesi",
       title   = "Algorithm 1026: Concurrent Alternating Least Squares for multiple simultaneous Canonical Polyadic Decompositions",
       journal = "ACM Transactions on Mathematical Software",
       year    = 2022,
       volume  = 48,
       number  = 3,
       pages   = "1--20",
       month   = sep,
       doi     = "10.1145/3519383"
   }

   Tensor decompositions, such as CANDECOMP/PARAFAC (CP), are widely used in a variety of applications, such as chemometrics, signal processing, and machine learning. A broadly used method for computing such decompositions relies on the Alternating Least Squares (ALS) algorithm. When the number of components is small, regardless of its implementation, ALS exhibits low arithmetic intensity, which severely hinders its performance and makes GPU offloading ineffective. We observe that, in practice, experts often have to compute multiple decompositions of the same tensor, each with a small number of components (typically fewer than 20), to ultimately find the best ones to use for the application at hand. In this paper, we illustrate how multiple decompositions of the same tensor can be fused together at the algorithmic level to increase the arithmetic intensity. Therefore, it becomes possible to make efficient use of GPUs for further speedups; at the same time the technique is compatible with many enhancements typically used in ALS, such as line search, extrapolation, and non-negativity constraints. We introduce the Concurrent ALS algorithm and library, which offers an interface to Matlab, and a mechanism to effectively deal with the issue that decompositions complete at different times. Experimental results on artificial and real datasets demonstrate a shorter time to completion due to increased arithmetic intensity.

   abstractwebbibtexhide
2. Accelerating jackknife resampling for the Canonical Polyadic Decomposition
   Christos Psarras, Lars Karlsson, Rasmus Bro and Paolo Bientinesi
   Frontiers in Applied Mathematics and Statistics, Volume 8, April 2022.

   @article{Psarras2022:328,
       author  = "Christos Psarras and Lars Karlsson and Rasmus Bro and Paolo Bientinesi",
       title   = "Accelerating jackknife resampling for the Canonical Polyadic Decomposition",
       journal = "Frontiers in Applied Mathematics and Statistics",
       year    = 2022,
       volume  = 8,
       month   = apr,
       doi     = "10.3389/fams.2022.830270",
       url     = "https://www.frontiersin.org/articles/10.3389/fams.2022.830270/pdf"
   }

   The Canonical Polyadic (CP) tensor decomposition is frequently used as a model in applications in a variety of different fields. Using jackknife resampling to estimate parameter uncertainties is often desirable but results in an increase of the already high computational cost. Upon observation that the resampled tensors, though different, are nearly identical, we show that it is possible to extend the recently proposed Concurrent ALS (CALS) technique to a jackknife resampling scenario. This extension gives access to the computational efficiency advantage of CALS for the price of a modest increase (typically a few percent) in the number of floating point operations. Numerical experiments on both synthetic and real-world datasets demonstrate that the new workflow based on a CALS extension can be several times faster than a straightforward workflow where the jackknife submodels are processed individually.

   abstractwebPDFbibtexhide

IEEE/ACM George Michael Memorial HPC Fellowship

1. Linda Gesenhues and Markus Höhnerbach Named Recipients of 2018 ACM-IEEE CS George Michael Memorial HPC Fellowships
   ACM Media Center

Linnea

Supercomputing 2018

1. PotC: Many-Body Potential Implementations à La Carte
   Markus Höhnerbach and Paolo Bientinesi

Algorithm Generation

1. On the Performance Prediction of BLAS-based Tensor Contractions
   Elmar Peise, Diego Fabregat-Traver and Paolo Bientinesi
   High Performance Computing Systems. Performance Modeling, Benchmarking, and Simulation, Lecture Notes in Computer Science, Volume 8966, pp. 193-212, Springer International Publishing, April 2015.

   @inproceedings{Peise2015:380,
       author    = "Elmar Peise and Diego Fabregat-Traver and Paolo Bientinesi",
       title     = "On the Performance Prediction of BLAS-based Tensor Contractions",
       booktitle = "High Performance Computing Systems. Performance Modeling, Benchmarking, and Simulation",
       year      = 2015,
       editor    = "Jarvis, Stephen A. and Wright, Steven A. and Hammond, Simon D.",
       volume    = 8966,
       series    = "Lecture Notes in Computer Science",
       pages     = "193-212",
       month     = apr,
       publisher = "Springer International Publishing",
       doi       = "10.1007/978-3-319-17248-4_10",
       url       = "http://arxiv.org/pdf/1409.8608v1"
   }

   Tensor operations are surging as the computational building blocks for a variety of scientific simulations and the development of high-performance kernels for such operations is known to be a challenging task. While for operations on one- and two-dimensional tensors there exist standardized interfaces and highly-optimized libraries (BLAS), for higher dimensional tensors neither standards nor highly-tuned implementations exist yet. In this paper, we consider contractions between two tensors of arbitrary dimensionality and take on the challenge of generating high-performance implementations by resorting to sequences of BLAS kernels. The approach consists in breaking the contraction down into operations that only involve matrices or vectors. Since in general there are many alternative ways of decomposing a contraction, we are able to methodically derive a large family of algorithms. The main contribution of this paper is a systematic methodology to accurately identify the fastest algorithms in the bunch, without executing them. The goal is instead accomplished with the help of a set of cache-aware micro-benchmarks for the underlying BLAS kernels. The predictions we construct from such benchmarks allow us to reliably single out the best-performing algorithms in a tiny fraction of the time taken by the direct execution of the algorithms.

   abstractwebPDFbibtexhide

Many-Body Potential Optimization

Optimizing core many-body potentials for molecular dynamics simulations in materials science.