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

165329494658 · Jun 202019922001200920172026
48 results for separating time

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.

Paper investigates separating times for general diffusions, providing new insights.

problem Understanding phase transitions between equivalence and singularity in diffusions.
method Representation of separating time as hitting time of a deterministic set, characterized by speed and scale.
result Explicit and easy-to-check conditions for absolute continuity and singularity of diffusions.

The paper establishes a nearly-sharp statistical threshold for efficient learning in Latent MDPs with separated components.

problem Learning Latent Markov Decision Processes (LMDPs) with separated components.
method The paper considers various notions of separation and establishes a nearly-sharp statistical threshold for efficient learning. It also presents a quasi-polynomial algorithm with time complexity scaling in terms of the statistical threshold under a weaker assumption of separability under the optimal policy, and a near-matching time complexity lower bound under the exponential time hypothesis.
result Establishes a nearly-sharp statistical threshold for efficient learning in Latent MDPs with separated components.

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 ↗

The study shows subgroup separability conditions for specific groups.

problem Conditions for subgroup separability in free-by-cyclic and deficiency 1 groups.
method Analyzes polynomially growing monodromy and asymptotic probability of random groups.
result Random deficiency 1 groups are not subgroup separable with positive probability.

This paper provides a mathematical framework for time-delay reservoir computing.

problem Lack of rigorous mathematical foundations for reservoir computing properties.
method Control-theoretic framework, formal definitions of separation and fading memory, explicit lower bound derivation.
result Established formal definitions and connections to stability notions for time-delay systems.

New non-separable covariance kernels for spatiotemporal data derived from harmonic oscillator physics.

problem Capturing complex spatiotemporal dependencies in Gaussian processes.
method Hybrid spectral method based on the harmonic oscillator, deriving explicit covariance kernels.
result Explicit non-separable covariance kernels with space-time interactions.

A new method for separating mixed signals in space and time.

problem Nonlinear and nonstationary spatio-temporal data challenges.
method Identifiable autoregressive variational autoencoder.
result The method outperforms existing techniques in blind source separation and spatio-temporal prediction.

We consider Aubry-Mather theory for a subclass of class A spacetimes, i.e. compact vicious spacetimes with globally hyperbolic Abelian cover. In this subclass, called class A_1, we obtain improved results on timelike maximizers and Lipschitz continuity of the time separation of the Abelian cover on the i.g. optimal sub…

2011-04-19abs ↗pdf ↗

Separation of the sources and analysis of their connectivity have been an important topic in EEG/MEG analysis. To solve this problem in an automatic manner, we propose a two-layer model, in which the sources are conditionally uncorrelated from each other, but not independent; the dependence is caused by the causality i…

2012-03-15abs ↗pdf ↗

Singing voice separation attempts to separate the vocal and instrumental parts of a music recording, which is a fundamental problem in music information retrieval. Recent work on singing voice separation has shown that the low-rank representation and informed separation approaches are both able to improve separation qu…

2018-01-09abs ↗pdf ↗

In this paper, we propose a two-step training procedure for source separation via a deep neural network. In the first step we learn a transform (and it's inverse) to a latent space where masking-based separation performance using oracles is optimal. For the second step, we train a separation module that operates on the…

2019-10-22abs ↗pdf ↗

A new NMF variant tackles underdetermined problems with sparse and separable assumptions.

problem Underdetermined blind source separation, especially multispectral image unmixing.
method Sparse Separable Nonnegative Matrix Factorization (SSNMF) combining separability and sparsity assumptions. Algorithm based on SNPA and sparse nonnegative least squares.
result In noiseless settings, the algorithm recovers true underlying sources.

In recent times, the use of separable convolutions in deep convolutional neural network architectures has been explored. Several researchers, most notably (Chollet, 2016) and (Ghosh, 2017) have used separable convolutions in their deep architectures and have demonstrated state of the art or close to state of the art pe…

2017-01-16abs ↗pdf ↗

Algorithm distinguishes Gaussian mixtures from pure Gaussians in quasi-polynomial time.

problem Distinguishing mixtures of Gaussian components from pure Gaussians, especially when components are well-separated.
method Sum-of-Squares method, quasi-polynomial time algorithm, bipartitioning sample to separate components.
result Algorithm can reliably distinguish between mixtures and pure Gaussians in quasi-polynomial time.

VoiceFilter-Lite separates speech from background in real-time for on-device speech recognition.

problem Separate speech from background in real-time for on-device speech recognition.
method Asymmetric loss, adaptive runtime suppression, quantization to 8-bit.
result VoiceFilter-Lite achieves real-time speech separation and maintains speech recognition performance.

Q(ΔΔ)-Learning improves Q-Learning by separating action-value functions into different time scales.

problem Q-Learning struggles with bias-variance trade-off, especially in long-term rewards.
method Introduces Q(ΔΔ)-Learning, extending TD(ΔΔ) to decompose Q(ΔΔ)-function into distinct discount factors.
result Q(ΔΔ)-Learning achieves better stability and scalability, especially for long-term tasks.

Mirror flow optimizes separable data problems, converging to a maximum margin classifier.

problem Optimizing classification problems with separable data using mirror flow.
method Examine mirror flow on linearly separable classification problems, focusing on the horizon function of the mirror potential.
result Mirror flow converges to a maximum margin classifier for separable data under certain conditions.

TiAda adapts adaptive gradient methods for nonconvex minimax optimization.

problem Nonconvex minimax optimization challenges in achieving convergence.
method TiAda is a time-scale adaptive GDA algorithm for nonconvex minimax optimization.
result TiAda achieves near-optimal complexities in deterministic and stochastic settings.

NullSpaceNet maps inputs to a joint-nullspace for clearer class separability.

problem Class separability and interpretability in image classification.
method NullSpaceNet maps inputs to a joint-nullspace, collapsing same-class inputs and separating different classes.
result NullSpaceNet achieves superior performance with reduced parameters and time.

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 ↗

Paper improves speech separation by using deep neural networks for more accurate density priors.

problem Improving the accuracy of source priors for independent vector analysis in speech separation.
method Estimating the derivative of speech density using deep neural networks to optimize performance indices.
result Neural network density priors outperform previous ones in convergence speed and SIR.