Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

171342513684 · Jun 202019922001200920172026
48 results for Task Separability

Recent deep learning approaches have achieved impressive performance on speech enhancement and separation tasks. However, these approaches have not been investigated for separating mixtures of arbitrary sounds of different types, a task we refer to as universal sound separation, and it is unknown how performance on spe…

2019-05-08abs ↗pdf ↗

Adversarial online multi-task RL with task separation.

problem Minimize regret in an adversarial online multi-task setting with unknown MDPs.
method Prove minimax and instance-specific lower bounds, develop a clustering algorithm with optimal sample complexity and regret.
result Tight sample complexity and regret bounds for adversarial online multi-task RL.

This paper strengthens the computational separation between multimodal and unimodal learning, showing unimodal learning is hard on typical instances.

problem Theoretical justification for empirical success of multimodal machine learning.
method Introduced a stronger average-case computational separation between unimodal and multimodal learning.
result For typical instances, unimodal learning is computationally hard, while multimodal learning is easy.

The paper extends optimal transport for linear separability of sheared distributions in supervised learning.

problem Learning on the space of probability measures using shifts and scalings.
method Embedding probability measures into L2L^2 spaces using optimal transport, then applying regular machine learning techniques.
result Sheared distributions can be linearly separated under certain conditions, with bounds on transformations.

Spatial blind source separation simplifies multivariate spatial prediction.

problem Predicting multivariate measurements at unobserved locations with spatial dependencies.
method Spatial blind source separation as a pre-processing tool compared to Cokriging and neural networks.
result Spatial blind source separation simplifies spatial prediction by avoiding cross-dependencies.

PeL separates sensory interface optimization from decision learning.

problem Optimizing sensory interfaces without task-specific information.
method Formal separation of perception and decision learning, using metrics for stability, informativeness, and geometry.
result Updates preserving invariants are orthogonal to decision gradients.

This paper proposes a new evaluation metric and boosting method for weight separability in neural network design. In contrast to general visual recognition methods designed to encourage both intra-class compactness and inter-class separability of latent features, we focus on estimating linear independence of column vec…

2019-10-20abs ↗pdf ↗

Source separation for music is the task of isolating contributions, or stems, from different instruments recorded individually and arranged together to form a song. Such components include voice, bass, drums and any other accompaniments.Contrarily to many audio synthesis tasks where the best performances are achieved b…

2019-11-27abs ↗pdf ↗

Separating mixed distributions is a long standing challenge for machine learning and signal processing. Most current methods either rely on making strong assumptions on the source distributions or rely on having training samples of each source in the mixture. In this work, we introduce a new method---Neural Egg Separat…

2018-11-30abs ↗pdf ↗

We consider neural network training, in applications in which there are many possible classes, but at test-time, the task is a binary classification task of determining whether the given example belongs to a specific class, where the class of interest can be different each time the classifier is applied. For instance, …

2017-05-29abs ↗pdf ↗

Learning representations with diversified information remains as an open problem. Towards learning diversified representations, a new approach, termed Information Competing Process (ICP), is proposed in this paper. Aiming to enrich the information carried by feature representations, ICP separates a representation into …

2019-06-04abs ↗pdf ↗

Paper tackles graph class-incremental learning with task profiling and prompting.

problem Challenges in separating classes from different tasks in graph CIL.
method Laplacian smoothing-based task profiling and graph prompting approach.
result 100% task ID prediction accuracy and significant performance improvement.

We introduce Wavesplit, an end-to-end source separation system. From a single mixture, the model infers a representation for each source and then estimates each source signal given the inferred representations. The model is trained to jointly perform both tasks from the raw waveform. Wavesplit infers a set of source re…

2020-02-20abs ↗pdf ↗

Inverse Drum Machine separates drum mixes using transcription and synthesis.

problem Separating individual drum tracks from mixed recordings.
method Analysis-by-synthesis framework combining deep learning and automatic transcription.
result Separation quality comparable to supervised methods requiring isolated stems.

Research explores the trade-off between multi-task learning and multitasking in deep neural networks.

problem Trade-off between multi-task learning and multitasking in deep neural networks.
method Meta-learning algorithm to manage the trade-off between shared and separated representations.
result Agent successfully optimizes training strategy based on environment.

Separates estimation and control in risk-sensitive investment problems with partial observation.

problem Risk-sensitive investment problems with incomplete observation.
method Investigates separability of a general class of risk-sensitive investment management problems using a finite-dimensional filter.
result The separated problem is strictly equivalent to the original control problem.

We consider the problem of distributed multi-task learning, where each machine learns a separate, but related, task. Specifically, each machine learns a linear predictor in high-dimensional space,where all tasks share the same small support. We present a communication-efficient estimator based on the debiased lasso and…

2015-10-02abs ↗pdf ↗

We study the problem of distributed multi-task learning with shared representation, where each machine aims to learn a separate, but related, task in an unknown shared low-dimensional subspaces, i.e. when the predictor matrix has low rank. We consider a setting where each task is handled by a different machine, with sa…

2016-03-07abs ↗pdf ↗

With deep learning approaches becoming state-of-the-art in many speech (as well as non-speech) related machine learning tasks, efforts are being taken to delve into the neural networks which are often considered as a black box. In this paper it is analyzed how recurrent neural network (RNNs) cope with temporal dependen…

2018-08-24abs ↗pdf ↗

A geometric theory explains loss functions for robust representation learning.

problem Treats robustness, domain adaptation, and sensor drift as separate literatures.
method Estimates covariance Sigma_task and uses it to pin Jacobian penalties.
result Proves optimality and necessity of range coverage for penalty matrices.

Unified scoring model improves efficiency and performance across multiple tasks.

problem Efficient and resource-efficient automated scoring for diverse tasks.
method Knowledge-distilled multi-task Mixture-of-Experts (MoE) approach.
result Comparable performance to task-specific models with significantly less storage and training resources.

Anomaly detection is a challenging task that frequently arises in practically all areas of industry and science, from fraud detection and data quality monitoring to finding rare cases of diseases and searching for new physics. Most of the conventional approaches to anomaly detection, such as one-class SVM and Robust Au…

2019-12-19abs ↗pdf ↗

Shallow nonlinear networks can separate classes linearly with polynomially scaling width.

problem Understanding the linear separability of deep networks' features.
method Modeling inputs as a union of low-dimensional subspaces and using random weights and quadratic activations.
result Shallow nonlinear networks can achieve linear separation with polynomially scaling width.

Randomized block-diagonal preconditioning improves parallel learning convergence.

problem Improving convergence of gradient-based optimization methods in parallel settings.
method Randomization of coordinates during optimization to repartition tasks.
result Randomization significantly improves convergence of block-diagonal preconditioned methods.

SepIt improves speech separation for multiple speakers.

problem Improving speech separation for multiple speakers in single channel recordings.
method SepIt uses a deep neural network that iteratively improves estimates of different speakers based on mutual information.
result SepIt outperforms state-of-the-art methods for 2, 3, 5, and 10 speakers.

slimTrain simplifies DNN training by separating features and adapting hyperparameters.

problem Challenges in training deep neural networks, including non-convexity, non-smoothness, and hyperparameter sensitivity.
method slimTrain exploits separability in DNN architectures to reduce hyperparameter sensitivity and improve convergence.
result slimTrain outperforms existing methods with recommended hyperparameters and reduces sensitivity to remaining hyperparameters.

Reservoir computing's success depends on mapping different input time series to separable states.

problem Quantifying the ability of random linear reservoirs to map different input time series.
method Mathematical framework using spectral properties of the connectivity matrix.
result Separation capacity is fully characterized by the spectral properties of the connectivity matrix.