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

336699132 · May 202619922001200920172026
48 results for unique recovery

The paper improves conditions for unique recovery in homomorphic sensing of subspaces.

problem Unique recovery of points in a linear subspace from their images under linear maps.
method Tighter and simpler conditions for unique recovery in single and subspace arrangement cases, extending to noise stability.
result Conditions for unique recovery in homomorphic sensing are improved and unified.

The non-negative solution to an underdetermined linear system can be uniquely recovered sometimes, even without imposing any additional sparsity constraints. In this paper, we derive conditions under which a unique non-negative solution for such a system can exist, based on the theory of polytopes. Furthermore, we deve…

2013-03-12abs ↗pdf ↗

Given an overcomplete dictionary AA and a signal bb that is a linear combination of a few linearly independent columns of AA, classical sparse recovery theory deals with the problem of recovering the unique sparse representation xx such that b=Axb = A x. It is known that under certain conditions on AA, xx can be re…

2015-07-06abs ↗pdf ↗

This paper improves credit risk analysis by incorporating state-dependent recovery rates into a factor model.

problem Accurate default forecasting in credit risk analysis.
method Extends a one-factor Gaussian copula model to include state-dependent recovery rates and a common factor.
result The proposed model outperforms other models in default prediction, especially during hectic periods.

This work provides a guaranteed tensor recovery method by combining low-rankness and smoothness priors.

problem Guaranteed tensor recovery with theoretical guarantees for low-rank and smoothness priors.
method Developed a new regularization term that combines low-rankness and smoothness priors, proving exact recovery guarantees.
result Rigorously proved exact recovery guarantees for tensor completion and tensor robust principal component analysis.

New guarantees for uniquely identifying transport maps and vector fields from finite measure-valued data.

problem Unique recovery of transport maps and vector fields from finite measure-valued data.
method Use of Whitney and Takens embedding theorems to establish conditions for unique identification.
result New metric for comparing diffeomorphisms and analogous results in infinitesimal settings.

New method recovers matrices with nonlinear structures using optimization on Grassmann manifold.

problem Recovering high-rank matrices with nonlinear structures like subspaces or clusters.
method Formulated as rank minimization of a nonlinear feature map, approximated by constrained non-convex optimization on the Grassmann manifold, using Riemannian and alternating minimization schemes.
result Global convergence and worst-case complexity bounds for alternating minimization scheme, leading to unique limit point.

Adaptive IP approach optimizes intervention design for causal graph recovery.

problem Designing efficient interventions to recover causal relationships from data.
method Iterative integer programming approach for optimizing information gain.
result Adaptive IP approach achieves full causal graph recovery with fewer interventions.

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 ↗

The study analyzes aftershocks of stock market crashes using statistical methods.

problem Understanding the aftershocks of stock market crashes during crises.
method Structural break analysis and statistical methods applied to 1987 crash, 2008 financial crisis, and 2020 COVID-19 pandemic.
result The recovery of stock price during the COVID-19 pandemic may be faster than the financial crisis of 2008.

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.

Paper recovers latent causal structure and linear transformation from indirect observations.

problem Recovering latent causal structure and linear transformation from indirect observations.
method Established sufficient conditions for DAG recovery, leveraged score function properties, and used soft/hard interventions.
result Perfect recovery of latent DAG structure and linear transformation up to scaling using soft interventions, hard interventions with additional hypothesis testing.

This study develops a dynamic inverse optimization framework to recover hidden, time-varying preferences from observed allocation trajectories.

problem The gap between classical optimization theory and real-world practice, especially in the presence of drift and shocks.
method Dynamic inverse optimization framework using a drift-aware estimator grounded in convex analysis and online learning theory.
result Sharp static and dynamic regret bounds for the framework, demonstrating its responsiveness to gradual drift and sudden shocks.

New approach improves classification guarantees by focusing on direction rather than regression risk.

problem Improving classification guarantees in binary classification problems.
method Establishing a geometric distinction between classification and regression, leveraging scale invariance.
result Improved guarantees for classification risk compared to regression risk.

There is a recent surge of interest in identifying the sharp recovery thresholds for cluster recovery under the stochastic block model. In this paper, we address the more refined question of how many vertices that will be misclassified on average. We consider the binary form of the stochastic block model, where nn ver…

2015-09-10abs ↗pdf ↗

Paper analyzes VI for location-scale families, proving robustness guarantees for mean and correlation recovery.

problem Misspecification in VI for intractable target densities.
method Variational inference on location-scale families with symmetries.
result VI recovers mean and correlation matrix under specific symmetries.

New algorithm recovers 3D molecule structures from noisy data.

problem Recovering 3D molecule structures from noisy, randomly rotated copies.
method Smoothed analysis of orbit recovery over SO(3)SO(3) using frequency marching.
result Quasi-polynomial time algorithm for orbit recovery over SO(3)SO(3).

Develops a new solver for path-dependent PDEs using signature kernels.

problem Solving path-dependent PDEs (PPDEs) efficiently and accurately.
method Uses signature kernels to solve PPDEs by approximating the solution with minimal norm in a reproducing kernel Hilbert space.
result Proves the consistency of the numerical scheme, ensuring convergence to PPDE solutions as the number of collocation points increases.

We generalize Merton's asset valuation approach to systems of multiple financial firms where cross-ownership of equities and liabilities is present. The liabilities, which may include debts and derivatives, can be of differing seniority. We derive equations for the prices of equities and recovery claims under no-arbitr…

2010-05-05abs ↗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 ↗

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.

CPR models complex decision processes by breaking them into context-specific policies, improving interpretability and accuracy.

problem Interpreting dynamic human decision-making processes in medical contexts.
method Develops Contextualized Policy Recovery (CPR) framework for multi-task learning, modeling each context-specific policy as a linear map.
result Achieves state-of-the-art performance in predicting medical decisions, closing the gap between interpretable and black-box methods.

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 method identifies physical constants from video data alone.

problem Identifying physical constants from video data.
method Proves level-set slope-coverage condition ensures local affine mapping to true physical state, enabling exact parameter recovery.
result Underdamped systems identifiable from a single video clip, other regimes require three diverse trajectories.

This paper improves support recovery in universal one-bit compressed sensing.

problem Support recovery in one-bit compressed sensing for sparse signals.
method Proposes approximate support recovery and superset recovery algorithms with polynomial-time complexity.
result Achieves improved support recovery with fewer measurements compared to existing methods.

We consider the problem of signal recovery on graphs as graphs model data with complex structure as signals on a graph. Graph signal recovery implies recovery of one or multiple smooth graph signals from noisy, corrupted, or incomplete measurements. We propose a graph signal model and formulate signal recovery as a cor…

2014-11-26abs ↗pdf ↗

IRKSN algorithm achieves sparse recovery with wider applicability conditions.

problem Sparse recovery challenges due to NP-hard nature and restrictive conditions.
method IRKSN algorithm based on kk-support norm regularizer.
result Achieves sparse recovery with explicit constants and standard linear rate.

Higher-order tensors can represent scores in a rating system, frames in a video, and images of the same subject. In practice, the measurements are often highly quantized due to the sampling strategies or the quality of devices. Existing works on tensor recovery have focused on data losses and random noises. Only a few …

2019-12-05abs ↗pdf ↗

In recent years research on credit risk modelling has mainly focused on default probabilities. Recovery rates are usually modelled independently, quite often they are even assumed constant. Then, however, the structural connection between recovery rates and default probabilities is lost and the tails of the loss distri…

2011-02-23abs ↗pdf ↗

Study optimal portfolio selection with Recovery Average Value at Risk, showing better control over liabilities.

problem Optimizing portfolios with a new risk measure under known or uncertain distributions.
method Existence results for mean-risk optimal portfolios under different distributional assumptions.
result Portfolio selection under Recovery Average Value at Risk provides better control over liabilities.