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

Trend · papers per month

4794141188 · Jun 202019922001200920172026
48 results for source recovery

StrTransformer recovers sources without labels by optimizing latent matrices and enforcing structural constraints.

problem Unsupervised blind source recovery in signal processing.
method Source-wise structured Transformer framework with latent source matrix optimization, structural regularization, and branch-specific weights.
result StrTransformer learns distinct temporal-scale structures and recovers source-aligned latent trajectories.

StrADiff separates sources from mixtures without labels, using structured priors.

problem Blind source separation of linear and nonlinear mixtures without labeled data.
method Structured Source-Wise Adaptive Diffusion Framework with Gaussian process priors.
result StrADiff can recover latent source trajectories in an unsupervised manner, especially stable in linear mixtures.

HTFM improves mode coverage and tail-statistic recovery for heavy-tailed data.

problem Tackles heavy-tailed data in various domains with rare events.
method Proposes a framework using clock-conditioned Gaussian sources and truncated logsignature features.
result Improves mode coverage, sample quality, and tail-statistic recovery over Gaussian flow matching and baselines.

Telecommunication (Telco) outdoor position recovery aims to localize outdoor mobile devices by leveraging measurement report (MR) data. Unfortunately, Telco position recovery requires sufficient amount of MR samples across different areas and suffers from high data collection cost. For an area with scarce MR samples, i…

2019-12-10abs ↗pdf ↗

Transfer learning improves loan recovery rate forecasting under data scarcity.

problem Data scarcity in loan portfolios limits RR modeling accuracy.
method Introduces FT-MDN-Transformer, a mixture-density tabular Transformer architecture for TL.
result FT-MDN-Transformer outperforms baseline models in RR forecasting, especially under covariate and conditional shifts.

Plug-and-play L-GM-AMP improves CS recovery for any i.i.d. source prior.

problem Efficiently recovering signals from compressed measurements with unknown priors.
method Deep learning with Gaussian-mixture model to approximate source prior, combined with learned denoising.
result L-GM-AMP achieves state-of-the-art performance without prior knowledge of source distribution.

Study on sparse recovery with mixed-quality data, establishing sample-size conditions.

problem Sparse recovery with heterogeneous noise from high- and low-quality sources.
method Establishes linear trade-off for sufficient conditions, analyzes LASSO algorithm.
result Linear trade-off for sufficient conditions, robustness of LASSO to data heterogeneity.

Recovering edge activities from node activity data in temporal networks.

problem Recovering lost edge activity data from aggregated node activity data in temporal networks.
method Analyzing the relationship between edge activity and node activity data, using both theoretical and empirical methods to show recovery is possible and under what conditions.
result Recovery of edge activities from node activities is possible with surprising accuracy, even when network density increases.

Study sparse function recovery from indirect noisy observations using 1\ell^1-regularization.

problem Recovering sparse functions from indirect, noisy observations.
method Proposes an 1\ell^1-regularized empirical risk minimizer and analyzes its statistical properties.
result Established almost-sure consistency and derived high-probability convergence rates in prediction and 1\ell^1 norms.

Independent Component Analysis (ICA) is a popular model for blind signal separation. The ICA model assumes that a number of independent source signals are linearly mixed to form the observed signals. We propose a new algorithm, PEGI (for pseudo-Euclidean Gradient Iteration), for provable model recovery for ICA with Gau…

2015-02-13abs ↗pdf ↗

New framework extends ICA for non-independent variables, identifying pairwise mean independence.

problem Non-independent variables complicating ICA recovery.
method Algebraic recovery algorithm based on least-squares optimization over the orthogonal group.
result Pairwise mean independence is identifiable, robust to independence constraints.

Auto-Encoders are unsupervised models that aim to learn patterns from observed data by minimizing a reconstruction cost. The useful representations learned are often found to be sparse and distributed. On the other hand, compressed sensing and sparse coding assume a data generating process, where the observed data is g…

2016-05-23abs ↗pdf ↗

A new model integrates covariates with grade of membership analysis for better latent structure recovery.

problem Improving latent structure recovery in multivariate categorical data analysis.
method Covariate-assisted grade of membership model exploiting shared low-rank simplex geometry.
result Auxiliary covariates can provably improve latent structure recovery, leading to faster convergence rates.

SAHMM-VAE separates sources adaptively using hidden Markov priors.

problem Unsupervised blind source separation.
method Source-wise adaptive Hidden Markov prior variational autoencoder.
result Different latent dimensions align with different source-specific temporal organizations.

Labeling training data is a key bottleneck in the modern machine learning pipeline. Recent weak supervision approaches combine labels from multiple noisy sources by estimating their accuracies without access to ground truth labels; however, estimating the dependencies among these sources is a critical challenge. We foc…

2019-03-14abs ↗pdf ↗

In data stream mining, predictive models typically suffer drops in predictive performance due to concept drift. As enough data representing the new concept must be collected for the new concept to be well learnt, the predictive performance of existing models usually takes some time to recover from concept drift. To spe…

2019-01-07abs ↗pdf ↗

Machine learning improves sub-hourly precipitation data recovery.

problem Missing precipitation data at sub-hourly intervals.
method Two-step process: rain/non-rain classification and rain intensity prediction.
result Machine learning outperforms traditional methods in predicting missing precipitation data.

New method for separating mixed signals with nonlinear functions.

problem Recovering source signals from nonlinear mixtures.
method Optimisation-based function approximation to minimize mutual statistical dependence.
result The method can recover source signals from nonlinear mixtures under certain conditions.

Bayesian method improves EEG source localization and estimates skull conductivity.

problem Improving EEG source localization accuracy with unknown skull conductivity.
method Bayesian Approximation Error approach using conditional Gaussian regression, iterative optimization, and physics-informed learning.
result Clear improvements in EEG source localization accuracy and feasible estimates for unknown skull conductivity.

This research tackles sample complexity in causal graph recovery with temporal heterogeneity.

problem Recovering a unique causal graph from observational data with temporal heterogeneity.
method Integrates time-series dynamics and multi-environment heterogeneity to constrain the problem, enabling a rigorous analysis of statistical limits.
result Unified necessary identifiability conditions and explicit information-theoretic bounds quantify the sample complexity under different noise distributions.

AVICA estimates noise levels for better group ICA source recovery.

problem Estimating shared independent sources from multiple noisy views.
method AVICA models each view as a linear mixture of shared sources with additive noise, optimizing noise levels alongside sources.
result AVICA yields better source estimates than other methods, especially in real-world applications like MEG and fMRI.

This work tackles community detection in networks with node attributes, achieving exact recovery.

problem Community detection in networks with correlated node attributes.
method Information-theoretic criterion and iterative clustering algorithm maximizing joint likelihood.
result Exact recovery of community labels under a general model for network and node attributes.

New method uses PINNs to solve complex PDEs with sparse measurements.

problem Joint estimation of source and parameters in advection-diffusion equations with limited data.
method Weighted adaptive approach based on neural tangent kernel of PINNs.
result Successful estimation of source function, velocity, and diffusion parameters.

Unified framework for distribution shift estimation, explanation, and improvement.

problem Estimating, explaining, and improving model performance on target domains with distribution shift.
method Entropic Projection Alignment (EPA) aligns source and target distributions by matching moments and minimizing KL divergence.
result EPA consistently outperforms state-of-the-art baselines while offering computational efficiency.

Federated online learning for streaming data with privacy and efficiency.

problem Analyzing continuous, heterogeneous data streams in a privacy-preserving manner.
method Personalized models for each data source, subgroup assumption, penalized renewable estimation, proximal gradient descent.
result Effective model for distributed multi-source streaming data analysis with privacy and efficiency.

Identifiability, or recovery of the true latent representations from which the observed data originates, is de facto a fundamental goal of representation learning. Yet, most deep generative models do not address the question of identifiability, and thus fail to deliver on the promise of the recovery of the true latent …

2019-09-27abs ↗pdf ↗

We derive an arbitrage free relationship between recovery swap rates, digital default swap spreads and conventional CDS spreads, and argue that the fair forward recovery rate used in recovery swaps must contain a convexity premium over the expected recovery value.

2010-01-05abs ↗pdf ↗

New framework for understanding BSS robustness under model violations.

problem Understanding how BSS solutions behave under statistical prior assumptions violations.
method Introducing an informative topology on the space of possible causes and explicit continuity guarantees.
result First comprehensive robustness framework for BSS.

We study the problem of recovery both the attenuation aa and the source ff in the attenuated X-ray transform in the plane. We study the linearization as well. It turns out that there are natural Hamiltonian flow that determines which singularities we can recover. If the perturbations δaδa, δfδf are supported in a com…

2011-05-08abs ↗pdf ↗

Robust methods for high-dimensional linear learning improve performance under heavy-tailed distributions and outliers.

problem Efficient learning in high-dimensional settings with robustness to outliers and heavy-tailed data.
method Two algorithms depending on gradient-Lipschitz loss function, applied to sparse, group-sparse, and low-rank matrix recovery.
result Achieved near-optimal estimation rates under heavy-tails and outliers, with computational cost comparable to non-robust methods.

Method uses Seq2Seq learning to automatically generate recovery commands for ICT systems.

problem Manual decision-making for recovery commands is time-consuming and error-prone.
method Seq2Seq neural network model trained on past logs and commands.
result The model can estimate accurate recovery commands from new failures.

A new model explains U- and Swoosh-shaped stock price recovery during the COVID-19.

problem Modeling stock price recovery during the COVID-19 with V- and L-shaped recovery.
method Introducing a sentiment variable θθ to quantify investor sentiment and simulate U- and Swoosh-shaped recovery.
result The model explains U- and Swoosh-shaped recovery of sectoral indices with positive sentiment.

New model for recovering unverifiable signals from observers in decentralized networks.

problem Verifying the level of service provided by untrusted parties in decentralized networks.
method Formal model of signal elicitation, source identifiability condition, and peer prediction techniques.
result Existence of a strictly truthful mechanism for unverifiable signal recovery.