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

336598130 · Jun 202019922001200920172026
48 results for automatic recovery

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.

Paper learns dictionaries for sparse signal recovery using automatic differentiation.

problem Learning dictionaries for sparse signal recovery from noisy data.
method Approximates reconstructions using FB algorithm and learns dictionaries with projected gradient descent.
result Successfully learns 1D TV dictionary from piecewise constant signals.

The subdifferential of convex functions of the singular spectrum of real matrices has been widely studied in matrix analysis, optimization and automatic control theory. Convex analysis and optimization over spaces of tensors is now gaining much interest due to its potential applications to signal processing, statistics…

2015-06-08abs ↗pdf ↗

Deep learning identifies functional primitives in stroke rehabilitation.

problem Measuring the necessary dose of rehabilitation training for stroke recovery.
method Automatic identification of functional primitives using IMUs and deep learning.
result Convolutional neural network achieved 70% accuracy in primitive classification.

Many traditional signal recovery approaches can behave well basing on the penalized likelihood. However, they have to meet with the difficulty in the selection of hyperparameters or tuning parameters in the penalties. In this article, we propose a global adaptive generative adjustment (GAGA) algorithm for signal recove…

2019-11-02abs ↗pdf ↗

Study robust recovery of low-rank matrices from corrupted measurements without rank prior.

problem Robust recovery of low-rank matrices from corrupted Gaussian measurements with unknown rank.
method Subgradient method with diminishing stepsizes for nonconvex nonsmooth problem.
result Subgradient method converges to exact low-rank solution at sublinear rate under RDPP condition.

Jointly learns feature and sample relevancies for robust sparse recovery.

problem Sparse recovery sensitivity to data contaminants like outliers or misspecified noise.
method Jointly learns feature and sample relevancies via marginal likelihood optimization.
result Consistent sparse and robust prediction models across diverse tasks.

In this paper, we develop an approach to recursively estimate the quadratic risk for matrix recovery problems regularized with spectral functions. Toward this end, in the spirit of the SURE theory, a key step is to compute the (weak) derivative and divergence of a solution with respect to the observations. As such a so…

2012-05-07abs ↗pdf ↗

Manifold embedding algorithms map high-dimensional data down to coordinates in a much lower-dimensional space. One of the aims of dimension reduction is to find intrinsic coordinates that describe the data manifold. The coordinates returned by the embedding algorithm are abstract, and finding their physical or domain-r…

2018-11-29abs ↗pdf ↗

SLIC-UAV monitors forest recovery using UAVs and machine learning.

problem Challenges in monitoring forest recovery, especially in logged tropical forests.
method Novel pipeline for UAV imagery analysis, combining crown labelling, species classification, and superpixel segmentation.
result SLIC-UAV achieves high accuracy in species mapping, from 79.3% to 90.5%.

Supervised learning is an active research area, with numerous applications in diverse fields such as data analytics, computer vision, speech and audio processing, and image understanding. In most cases, the loss functions used in machine learning assume symmetric noise models, and seek to estimate the unknown function …

2015-11-12abs ↗pdf ↗

i-SpaSP prunes neural networks by identifying important groups of parameters, improving pruning efficiency.

problem Pruning neural networks to reduce computational cost and improve performance.
method i-SpaSP uses sparse signal recovery principles to iteratively identify and threshold important parameter groups.
result i-SpaSP achieves strong empirical results and theoretical convergence guarantees, improving pruning efficiency.

AD-EnKFs use machine learning to improve data assimilation in high-dimensional systems.

problem Data assimilation in high-dimensional, unknown dynamics systems.
method Auto-differentiable ensemble Kalman filters blending machine learning and ensemble Kalman filters.
result AD-EnKFs outperform existing methods in the Lorenz-96 model.

Recently deep neural networks have been successfully used for various classification tasks, especially for problems with massive perfectly labeled training data. However, it is often costly to have large-scale credible labels in real-world applications. One solution is to make supervised learning robust with imperfectl…

2018-11-09abs ↗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 ↗

EML-CD discovers causal mechanisms from neural networks in a structured way.

problem Extracting causal mechanisms from neural network weights is ill-posed.
method Integrates EML operator into causal structure learning, representing each edge mechanism as a gated EML binary tree.
result Achieves SHD=11.2 +/- 0.4 on real data, matching or outperforming existing methods.

Bayesian model improves image completion accuracy by automatically learning low rank structure.

problem Improving image completion accuracy with limited data and avoiding overfitting.
method Developed a Bayesian low rank tensor ring model with multiplicative interaction and Student-T distribution for sparse core factors.
result The proposed method outperforms state-of-the-art image completion techniques, especially in recovery accuracy.

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.

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.

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.

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.

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.

We consider the problem of robust compressed sensing whose objective is to recover a high-dimensional sparse signal from compressed measurements corrupted by outliers. A new sparse Bayesian learning method is developed for robust compressed sensing. The basic idea of the proposed method is to identify and remove the ou…

2016-10-10abs ↗pdf ↗

Unified framework for pattern recovery in penalized and thresholded estimation.

problem Pattern recovery in penalized and thresholded estimation methods.
method Defining a novel pattern notion based on subdifferentials, introducing accessibility and noiseless recovery conditions.
result Unified and extended conditions for pattern recovery in a broad class of penalized estimators.

Paper explores exact recovery of communities in weighted graphs using Gaussian and exponential distributions.

problem Exact recovery of communities in weighted graphs with Gaussian and exponential distributions.
method Introduces a new semi-metric to describe conditions for exact recovery and analyzes conditions for both complete and incomplete graphs.
result Necessary and sufficient conditions for exact recovery are asymptotically tight and applicable to both complete and incomplete graphs.

Guarantees sparse recovery for neural networks with iterative hard thresholding.

problem Recovering sparse network weights in neural networks.
method Structural properties of sparse network weights and iterative hard thresholding algorithm.
result Simple iterative hard thresholding algorithm recovers sparse network weights exactly using linear memory.

New risk measure improves creditor protection in financial regulation.

problem Current solvency requirements fail to control the size of recovery on creditors' claims.
method Developed Recovery Value at Risk (Recovery VaR) to control recovery on creditors' claims.
result Recovery VaR flexibly controls recovery on creditors' claims and integrates protection needs into management incentives.