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

159319478637 · Jun 202019922001200920172026
48 results for state reconstruction

ROAD-EnKFs use learned low-dimensional models to improve state reconstruction and forecasting.

problem Reconstructing and forecasting states of unknown or expensive systems.
method Learned low-dimensional surrogate models and ensemble Kalman filter integration.
result ROAD-EnKFs achieve higher accuracy at lower computational cost than existing methods.

New quantum state reconstruction method accelerates convergence.

problem Quantum state reconstruction for larger systems.
method Momentum-Inspired Factored Gradient Descent (MiFGD) combining compressed sensing, non-convex optimization, and acceleration.
result Converges to true density matrix at an accelerated linear rate, provably close to the true matrix.

Paper defines AI-specific loss reconstruction problem and introduces CER framework.

problem Reconstructing AI-generated losses, especially in agentic systems.
method CER framework: C (control boundary), E (evidence reconstruction), R (insurance response).
result Defines AI-specific reconstruction problem and operationalizes it.

Deep learning scheme identifies and reconstructs chaotic and stochastic systems from noisy data.

problem Challenging identification of governing equations from noisy and partial observations.
method Jointly learns inference model and governing laws using variational deep learning.
result Framework generalizes state-of-the-art methods and accounts for stochastic variabilities.

GCVAE improves disentanglement in VAEs while balancing reconstruction error.

problem Improving disentanglement in VAEs while maintaining low reconstruction error.
method Introduces three controllable Lagrangian hyperparameters to optimize reconstruction and KL divergence loss.
result GCVAE outperforms state-of-the-art models in disentanglement while balancing reconstruction.

New study analyzes security of neural network data reconstruction attacks.

problem Data reconstruction attacks pose a threat to private training data.
method Analyzes security boundary of data reconstruction attacks via neuron exclusivity state.
result Characterizes insecure/secure boundary of data reconstruction attacks.

Method reconstructs networks from contagion dynamics.

problem Fitting contagion models assumes simple dynamics, ignoring complex contagions.
method Nonparametric method to reconstruct network and dynamics from node states.
result Networks are easier to reconstruct through complex contagions in dense or saturated networks.

Reconstruction based subspace clustering methods compute a self reconstruction matrix over the samples and use it for spectral clustering to obtain the final clustering result. Their success largely relies on the assumption that the underlying subspaces are independent, which, however, does not always hold in the appli…

2012-06-18abs ↗pdf ↗

State of the art methods in astronomical image reconstruction rely on the resolution of a regularized or constrained optimization problem. Solving this problem can be computationally intensive and usually leads to a quadratic or at least superlinear complexity w.r.t. the number of pixels in the image. We investigate in…

2016-12-14abs ↗pdf ↗

New algorithm improves signal reconstruction from noisy measurements with side information.

problem Reconstructing unknown signals from noisy linear measurements with side information.
method Integrates side information into approximate message passing (AMP) and tracks performance using state evolution.
result AMP-SI performance is accurately predicted by state evolution.

We propose a novel autoencoding model called Pairwise Augmented GANs. We train a generator and an encoder jointly and in an adversarial manner. The generator network learns to sample realistic objects. In turn, the encoder network at the same time is trained to map the true data distribution to the prior in latent spac…

2018-10-11abs ↗pdf ↗

This paper aims to develop a new and robust approach to feature representation. Motivated by the success of Auto-Encoders, we first theoretical summarize the general properties of all algorithms that are based on traditional Auto-Encoders: 1) The reconstruction error of the input can not be lower than a lower bound, wh…

2017-10-08abs ↗pdf ↗

Proposes TCWAE to learn disentangled representations using the Wasserstein Autoencoder.

problem Balancing reconstruction fidelity and disentanglement in learning representations.
method TCWAE (Total Correlation Wasserstein Autoencoder) using different KL estimators.
result Competitive results on data sets with known generative factors, and improved reconstructions on unknown factors.

The analysis of Belief Propagation and other algorithms for the {\em reconstruction problem} plays a key role in the analysis of community detection in inference on graphs, phylogenetic reconstruction in bioinformatics, and the cavity method in statistical physics. We prove a conjecture of Evans, Kenyon, Peres, and Sch…

2019-05-24abs ↗pdf ↗

We propose an efficient algorithm for sparse signal reconstruction problems. The proposed algorithm is an augmented Lagrangian method based on the dual sparse reconstruction problem. It is efficient when the number of unknown variables is much larger than the number of observations because of the dual formulation. More…

2009-04-03abs ↗pdf ↗

BrainSurfCNN predicts task contrasts from resting-state fingerprints, improving accuracy over baseline.

problem Predicting task-evoked activity from resting-state functional connectivity.
method Surface-based convolutional neural network (BrainSurfCNN) with reconstructive-contrastive loss.
result Significantly improved accuracy in predicting task contrasts over baseline.

DCAE learns compact latent representations for one-class novelty detection.

problem Learning compact latent representations for one-class novelty detection.
method DCAE learns compact and collapse-free latent representations through internal discriminative layers of GANs, reconstructing in-class data finely and exclusively.
result DCAE achieves state-of-the-art performance on novelty and adversarial example detection.

Compressive Sensing (CS) theory asserts that sparse signal reconstruction is possible from a small number of linear measurements. Although CS enables low-cost linear sampling, it requires non-linear and costly reconstruction. Recent literature works show that compressive image classification is possible in CS domain wi…

2018-10-15abs ↗pdf ↗

Improved computed tomography reconstruction with deep learning and deep image prior.

problem Low data efficiency in computed tomography reconstruction.
method Combining learned primal-dual methods with deep image prior for improved quality and generalization.
result Proposed methods outperform state-of-the-art in low data regime.

We solve 6-DoF localisation and 3D reconstruction using deep state-space models.

problem 6-DoF localisation and dense 3D reconstruction in spatial environments.
method Approximate Bayesian inference in a deep state-space model combining learning and domain knowledge.
result Near state-of-the-art performance on UAV flight data.

New framework UIFV reconstructs private features in VFL without model details.

problem Privacy risks in VFL where adversaries can reconstruct sensitive features.
method Unified InverNet Framework (UIFV) that uses intermediate feature data.
result Significantly outperforms state-of-the-art techniques in attack precision.

iTimER learns from reconstruction errors to represent irregularly sampled time series.

problem Learning from irregularly sampled time series with missing data.
method iTimER models reconstruction errors as a proxy for unobserved values, using a mixup strategy and a Wasserstein metric.
result iTimER outperforms state-of-the-art methods in classification, interpolation, and forecasting tasks.

Magnetic resonance imaging (MRI) is known to be a slow imaging modality and undersampling in k-space has been used to increase the imaging speed. However, image reconstruction from undersampled k-space data is an ill-posed inverse problem. Iterative algorithms based on compressed sensing have been used to address the i…

2019-08-07abs ↗pdf ↗

This work combines deep learning and sparse coding for CT image reconstruction.

problem Improving image quality in low-dose CT scans.
method Sparse signal representation using learned dictionaries, inspired by variational autoencoders and deep learning techniques.
result Regularization with learned dictionaries achieves competitive performance in CT reconstruction.

This paper presents a novel method for the reconstruction of a neural network connectivity using calcium fluorescence data. We introduce a fast unsupervised method to integrate different networks that reconstructs structural connectivity from neuron activity. Our method improves the state-of-the-art reconstruction meth…

2015-05-30abs ↗pdf ↗

In compressed sensing, we wish to reconstruct a sparse signal xx from observed data yy. In sparse coding, on the other hand, we wish to find a representation of an observed signal yy as a sparse linear combination, with coefficients xx, of elements from an overcomplete dictionary. While many algorithms are competit…

2013-10-31abs ↗pdf ↗