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

Trend · papers per month

4897145193 · May 202619922001200920172026
48 results for joint separation

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.

Optimal joint separation condition for radar and communications channels in dual-blind deconvolution.

problem Recovering information from overlaid radar and communications signals with unknown channels.
method Extremal functions from Beurling-Selberg interpolation theory for joint separation, nuclear norm minimization for matrix retrieval, and MUSIC for parameter estimation.
result Guaranteed well-conditioned Vandermonde matrix for MUSIC, validating theoretical findings.

Develops large-sample theory for non-stationary source separation.

problem Lack of large-sample results for non-stationary source separation methods.
method Large-sample theory for NSS-JD method under specific assumptions.
result Consistency of unmixing estimator and its convergence to Gaussian distribution.

A new method for joint noise removal and trend estimation from sparse signals.

problem Jointly removing noise and estimating trends from sparse signals.
method PENDANTSS combines SOOT/SPOQ penalties with BEADS algorithm in a Trust-Region block alternating variable metric forward-backward approach.
result Outperforms comparable methods in deconvolving analytical chemistry signals.

New algorithm improves source separation with multi-trial supervision.

problem Non-convex optimization and interpretability of independent components.
method Proximal gradient-type algorithm in invertible matrices with backpropagation for joint learning.
result Increased success rate of non-convex optimization and improved interpretability.

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.

The approximate joint diagonalization of a set of matrices consists in finding a basis in which these matrices are as diagonal as possible. This problem naturally appears in several statistical learning tasks such as blind signal separation. We consider the diagonalization criterion studied in a seminal paper by Pham (…

2018-11-28abs ↗pdf ↗

An essential problem in domain adaptation is to understand and make use of distribution changes across domains. For this purpose, we first propose a flexible Generative Domain Adaptation Network (G-DAN) with specific latent variables to capture changes in the generating process of features across domains. By explicitly…

2018-04-12abs ↗pdf ↗

Unified framework for learning with indirect supervision signals.

problem Learning from indirect supervision signals when gold labels are missing or costly.
method Developed a unified theoretical framework for multi-class classification with variable supervision.
result Introduced the concept of separation to characterize learnability and generalization bounds.

Method estimates joint probability density from samples using low-rank decomposition and random projections.

problem Estimating joint probability density from limited samples.
method Low-rank tensor decomposition, dictionaries, and Radon transforms.
result Algorithm outperforms previous methods in estimating synthetic probability densities.

Estimates multiple related causal graphs with shared causal order.

problem Discovering multiple related Gaussian DAGs with shared causal order.
method Proposes a l1/l2l_1/l_2-regularized MLE for joint estimation of KK linear structural equation models.
result Joint estimator achieves better sample complexity and consistency in causal order recovery.

APQ jointly optimizes neural architecture, pruning, and quantization for efficient inference.

problem Efficient deep learning inference on resource-constrained hardware.
method Joint optimization of neural architecture, pruning, and quantization policy using a quantization-aware accuracy predictor.
result Joint optimization leads to 2.3% higher ImageNet accuracy with reduced latency and energy consumption.

We consider wireless transmission of images in the presence of channel output feedback. From a Shannon theoretic perspective feedback does not improve the asymptotic end-to-end performance, and separate source coding followed by capacity-achieving channel coding, which ignores the feedback signal, achieves the optimal …

2019-11-25abs ↗pdf ↗

The task of clustering a set of objects based on multiple sources of data arises in several modern applications. We propose an integrative statistical model that permits a separate clustering of the objects for each data source. These separate clusterings adhere loosely to an overall consensus clustering, and hence the…

2013-02-28abs ↗pdf ↗

This paper proposes a joint energy and data market to handle uncertainty in energy procurement.

problem Handling uncertainty in energy markets through data markets.
method Modeling a day-ahead retailer energy procurement problem with uncertain demand, integrating forecasting and optimisation, and using differential privacy.
result The value of joint energy and data clearing is highlighted through numerical case studies.

A method for identifying joint and individual subspaces from multi-view data.

problem Unclear conditions for reliably identifying joint and individual subspaces from noisy, high-dimensional measurements.
method Rigorously quantifies conditions based on signal rank, principal angles, and noise levels. Characterizes spectrum perturbations of product of projection matrices.
result Estimates joint and individual subspaces more accurately than existing approaches in simulations and real-world applications.

FL+HC improves federated learning on non-iid data by clustering local updates.

problem FL struggles with non-iid data, leading to suboptimal models.
method Introduce hierarchical clustering to separate and train clusters of clients independently.
result FL+HC converges faster and achieves higher accuracy than standard FL.

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.

MGLM models all possible language channel factorizations for improved multilingual generation.

problem Generating multilingual text with flexibility and quality.
method Generative joint distribution model over language channels, marginalizing all possible factorizations.
result MGLM outperforms traditional models in multilingual generation tasks.

Superintegrable systems are classical and quantum Hamiltonian systems which enjoy much symmetry and structure that permit their solubility via analytic and even, algebraic means. They include such well-known and important models as the Kepler potential, Calogero-Moser model, and harmonic oscillator, as well as its inte…

2012-09-25abs ↗pdf ↗

Reliable measures of statistical dependence could be useful tools for learning independent features and performing tasks like source separation using Independent Component Analysis (ICA). Unfortunately, many of such measures, like the mutual information, are hard to estimate and optimize directly. We propose to learn i…

2017-10-13abs ↗pdf ↗

A new framework for efficient Bayesian network inference.

problem High-dimensional Bayesian networks are hard to infer due to computational scaling.
method Directed convex subgraphs and minimal d-decomposition tree for decomposition, enabling parallel computation.
result The method reduces computational cost and enables parallel computation.

Integrative analysis of disparate data blocks measured on a common set of experimental subjects is a major challenge in modern data analysis. This data structure naturally motivates the simultaneous exploration of the joint and individual variation within each data block resulting in new insights. For instance, there i…

2017-04-07abs ↗pdf ↗

WR-CP reduces prediction set size and coverage gap under distribution shift.

problem Guaranteed coverage under distribution shift not achievable with i.i.d. assumption.
method Wasserstein distance, probability measure pushforwards, importance weighting, regularized representation learning.
result Reduces coverage gap to 3.2% across different confidence levels.

New decision-theoretic characterization separates belief and decision posteriors.

problem Understanding the conditions under which loss-based updating coincides with Bayesian updating.
method Decision-theoretic approach to distinguish belief and decision posteriors.
result Generalized Bayes coincides with ordinary Bayesian updating only if the loss is proportional to negative log-likelihood.

TensorGuide improves LoRA efficiency and expressivity through joint tensor-train optimization.

problem Limited expressivity and generalization of standard LoRA.
method TensorGuide uses a unified tensor-train structure with controlled Gaussian noise to generate correlated low-rank matrices.
result TensorGuide achieves superior accuracy and scalability with fewer parameters compared to standard LoRA and TT-LoRA.

A deep neural network detects sleep events in polysomnograms with high accuracy.

problem Manual scoring of sleep events in clinical analysis is inconsistent and time-consuming.
method A single deep neural network architecture trained on 1653 recordings for joint detection of arousals, leg movements, and sleep disordered breathing.
result Joint detection of sleep events yields higher accuracy compared to separate models, and correlates well with manual annotations.

DJPQ optimizes neural network pruning and quantization for hardware efficiency.

problem Efficiently compress neural networks for hardware inference.
method Joint gradient-based optimization of pruning and quantization into a differentiable loss function.
result Significant reduction in Bit-Operations (BOPs) with minimal accuracy loss.

Structured credal learning separates covariate shift and label disagreement.

problem Uncertainty in real-world learning tasks due to covariate shift and noisy labels.
method Introduces a structured credal learning framework that explicitly separates these sources.
result Geometric bounds and decomposition reveal how covariate shifts affect label disagreement contributions.

FairNN learns fair representations and decisions by optimizing a multi-objective loss function.

problem Fairness in machine learning models for decision-making.
method Joint feature representation and classification with multi-objective loss function.
result Joint approach outperforms separate treatment of fairness in representation learning or supervised learning.