Emanuele Rodolà, Giorgio Mariani, Emilian Postolache, Michele Mancusi, Luca Cosmo, Andrea Santilli
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Autoregressive models have achieved impressive results over a wide range of domains in terms of generation quality and downstream task performance. In the continuous domain, a key factor behind this success is the usage of quantized latent spaces (e.g., obtained via VQ-VAE autoencoders), which allow for dimensionality reduction and faster inference times. However, using existing pre-trained models to perform new non-trivial tasks is difficult since it requires additional finetuning or extensive training to elicit prompting. This paper introduces LASS as a way to perform vector-quantized Latent Autoregressive Source Separation (i.e., de-mixing an input signal into its constituent sources) without requiring additional gradient-based optimization or modifications of existing models. Our separation method relies on the Bayesian formulation in which the autoregressive models are the priors, and a discrete (non-parametric) likelihood function is constructed by performing frequency counts over latent sums of addend tokens. We test our method on images and audio with several sampling strategies (e.g., ancestral, beam search) showing competitive results with existing approaches in terms of separation quality while offering at the same time significant speedups in terms of inference time and scalability to higher dimensional data.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2301.08562")
get_code_for_paper("2301.08562")
have("2301.08562")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2301.08562.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2301.08562)
Connect an agent — have() is free.