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,742 papers · 148 categories

Trend · papers per month

2.7%5.4%8.1%10.7% · Nov 201819922001200920172026
48 results for Convolutive Mixtures

Study uniform consistency in nonparametric mixture models and mixed regression.

problem Uniform consistency in nonparametric mixture models and mixed regression models.
method Construct uniformly consistent estimators under general conditions, develop novel technical tools.
result Prove uniform consistency results for nonparametric mixtures and mixed regression models.

Multi-output Gaussian processes (MOGPs) are an extension of Gaussian Processes (GPs) for predicting multiple output variables (also called channels, tasks) simultaneously. In this paper we use the convolution theorem to design a new kernel for MOGPs, by modeling cross channel dependencies through cross convolution of t…

2018-08-07abs ↗pdf ↗

CMDRNN predicts user location using WiFi fingerprints with deep learning.

problem Predicting user activity with WiFi fingerprints is challenging due to high dimensionality.
method Combines CNN, RNN, and MDN to model high-dimensional time-series data.
result CMDRNN effectively predicts user location using WiFi fingerprints.

Two deep learning models improve indoor location prediction from WiFi fingerprints.

problem Indoor location prediction from WiFi fingerprints.
method Convolutional mixture density recurrent neural network and VAE-based semi-supervised learning model.
result Proposed models outperform existing methods in real-world datasets.

Learning representation on graph plays a crucial role in numerous tasks of pattern recognition. Different from grid-shaped images/videos, on which local convolution kernels can be lattices, however, graphs are fully coordinate-free on vertices and edges. In this work, we propose a Gaussian-induced convolution (GIC) fra…

2018-11-11abs ↗pdf ↗

Graph convolution improves linear separability and generalizes to out-of-distribution data.

problem Improving linear separability in semi-supervised classification.
method Applying graph convolution to mixtures of Gaussians in a stochastic block model.
result Graph convolution extends the linear separability regime by a factor of 1/D1/\sqrt{D}.

GCNs improve multi-layer network classification by expanding the distance between means.

problem Improving multi-layer network classification with graphical information.
method Theoretical and empirical study of graph convolutions in multi-layer networks.
result Graph convolutions expand the classification regime by a factor of 1/Emdeg41/\sqrt[4]{\mathbb{E}{ m deg}}.

New approach improves computational efficiency of Bass Local Volatility model.

problem Eliminate interpolation and improve computational efficiency in local volatility models.
method Combines local quadratic estimation and lognormal mixture tails for state price densities; uses trapezoidal rule for numerical convolutions.
result Proposed method outperforms traditional numerical methods in option pricing and market case studies.

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.

We propose a new blind source separation algorithm based on mixtures of alpha-stable distributions. Complex symmetric alpha-stable distributions have been recently showed to better model audio signals in the time-frequency domain than classical Gaussian distributions thanks to their larger dynamic range. However, infer…

2017-11-13abs ↗pdf ↗

Proposes a sparse classifier for discriminative Gaussian Mixture Models.

problem Softmax-based discriminative models assume unimodality, leading to parameter redundancy.
method Sparse Bayesian learning for GMM-based discriminative model, reducing parameters and complexity.
result The SDGM outperforms existing softmax-based discriminative models.

Proposes VCLANC for attributed network clustering using node and attribute embeddings.

problem Lack of mutual affinity exploitation between nodes and attributes in graph convolution.
method Dual variational auto-encoders for node and attribute embeddings, Gaussian mixture model priors, mutual distance and clustering assignment hardening losses.
result Demonstrates effectiveness on real-world attributed network datasets.

The study tightens the sample complexity for learning nonparametric mixture components.

problem Learning nonparametric distributions in a finite mixture model.
method Assumes each component is a convolution of a Gaussian and a compactly supported density, and uses a quantitative Tauberian theorem.
result Tight bounds on sample complexity required for estimating each component, showing it lies between polynomial and exponential.

We analyze the Levy processes produced by means of two interconnected classes of non stable, infinitely divisible distribution: the Variance Gamma and the Student laws. While the Variance Gamma family is closed under convolution, the Student one is not: this makes its time evolution more complicated. We prove that -- a…

2007-02-02abs ↗pdf ↗

Study on Bayesian deep linear networks with multiple outputs and convolutional layers.

problem Characterize feature learning in finite-width Bayesian deep linear networks.
method Exact and analytical formulas for joint and posterior distributions, using large deviation theory.
result Quantitative description of feature learning in infinite-width regime.

Many different methods to train deep generative models have been introduced in the past. In this paper, we propose to extend the variational auto-encoder (VAE) framework with a new type of prior which we call "Variational Mixture of Posteriors" prior, or VampPrior for short. The VampPrior consists of a mixture distribu…

2017-05-19abs ↗pdf ↗

Convolutional sparse coding (CSC) can learn representative shift-invariant patterns from multiple kinds of data. However, existing CSC methods can only model noises from Gaussian distribution, which is restrictive and unrealistic. In this paper, we propose a general CSC model capable of dealing with complicated unknown…

2019-03-08abs ↗pdf ↗

CNNs improve wind speed forecasts in the Netherlands.

problem Limited spatial patterns in current post-processing methods.
method Convolutional Neural Networks (CNNs) for spatial wind speed information.
result CNNs produce better probabilistic forecasts with higher Brier skill scores.

GCN adapted for graphs with missing features, improving performance.

problem GCN struggles with graphs containing missing features.
method Integrates missing feature processing within GCN architecture using Gaussian Mixture Model.
result Significantly outperforms imputation-based methods in node classification and link prediction.

This study analyzes theoretical guarantees for VI with fixed-variance Gaussian mixtures.

problem Theoretical analysis of variational inference with non-Gaussian distributions.
method Formulates variational inference as minimizing a mollified relative entropy, solving it through gradient descent on particle positions.
result Establishes descent lemma and approximation error bounds for optimization of variational inference.

Can we identify node labels from graph labels?

problem Identifying node labels from graph labels in a hierarchical network.
method Gaussian Mixture Graph Convolutional Network (GMGCN) with Graph Attention Network (GAT) and Gaussian Mixture Layer (GML).
result The proposed method outperforms other baselines on various benchmarks.

Semi-supervised learning algorithms reduce the high cost of acquiring labeled training data by using both labeled and unlabeled data during learning. Deep Convolutional Networks (DCNs) have achieved great success in supervised tasks and as such have been widely employed in the semi-supervised learning. In this paper we…

2016-12-06abs ↗pdf ↗

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 ↗

Phase segregation, the process by which the components of a binary mixture spontaneously separate, is a key process in the evolution and design of many chemical, mechanical, and biological systems. In this work, we present a data-driven approach for the learning, modeling, and prediction of phase segregation. A direct …

2018-03-23abs ↗pdf ↗

Training convolutional networks (CNN's) that fit on a single GPU with minibatch stochastic gradient descent has become effective in practice. However, there is still no effective method for training large CNN's that do not fit in the memory of a few GPU cards, or for parallelizing CNN training. In this work we show tha…

2017-04-20abs ↗pdf ↗

UNHaP removes noise from physiological events using Hawkes processes.

problem Challenges in identifying true events from spurious ones in physiological signal analysis.
method UNHaP uses marked Hawkes processes to distinguish and unmix true events from noise.
result UNHaP significantly reduces false detection rates and enhances event understanding.

Joint sensing and communication network improves target localization and reduces communication load.

problem Efficiently localize multiple targets with reduced communication overhead.
method Multi-base station cooperative sensing with AI-aided clustering and tracking.
result Optimal sub-pattern assignment (OSPA) error less than 60 cm with reduced communication capacity.

An evolutionary algorithm separates mixed DNA profiles in forensic genetics.

problem Deconvolving mixed DNA profiles from crime samples.
method Multiple population evolutionary algorithm (MEA) with guided mutation.
result The MEA successfully deconvoluted DNA profiles from crime samples.

New deep learning model estimates scattering timescale of FRBs efficiently.

problem Estimating scattering timescale of fast radio bursts (FRBs) is a bottleneck.
method Multimodal Transformer Based Generic Mixture Density Network (MT-GMDN) that ingests dynamic spectrum and timeseries profile.
result Achieves 94% R2R^2 on expected value of ττ for measurable scattering.

Casting neural networks in generative frameworks is a highly sought-after endeavor these days. Contemporary methods, such as Generative Adversarial Networks, capture some of the generative capabilities, but not all. In particular, they lack the ability of tractable marginalization, and thus are not suitable for many ta…

2016-10-13abs ↗pdf ↗

Study optimal spectral estimator for semi-supervised node classification.

problem Semi-supervised node classification on CSBM with limited labels.
method Spectral estimator inspired by PCA, graph ridge regression, GCN.
result Achieves information-theoretical threshold for exact recovery.