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

3469103137 · Jun 202019922001200920172026
48 results for Reconstruction Margins

New analysis shows reconstruction attacks are unreliable without prior data knowledge.

problem Privacy and security risks from neural network memorization of training data.
method Complementary analysis of reconstruction methods, proving their unreliability without prior data knowledge.
result Reconstruction attacks are fundamentally unreliable without prior data knowledge, and networks trained more extensively are less susceptible.

Due to the intractable partition function, the exact likelihood function for a Markov random field (MRF), in many situations, can only be approximated. Major approximation approaches include pseudolikelihood and Laplace approximation. In this paper, we propose a novel way of approximating the likelihood function throug…

2018-03-27abs ↗pdf ↗

Paper proposes MDAT to stabilize domain alignment in label-scarce settings.

problem Stable and comprehensive domain alignment in label-scarce settings.
method Max-margin Domain-Adversarial Training (MDAT) with Adversarial Reconstruction Network (ARN).
result MDAT stabilizes gradient reversing and achieves strong robustness to hyper-parameters.

Neurally Augmented ALISTA improves sparse reconstruction performance.

problem Improving sparse reconstruction performance with theoretical guarantees and empirical improvements.
method Integrates an LSTM network to compute adaptive step sizes and thresholds for each target vector during reconstruction.
result Empirical performance is further improved, especially as compression ratios become more challenging.

Method estimates uncertainty in CT reconstructions.

problem Lack of accurate uncertainty estimates in deep-learning CT reconstructions.
method Linearised deep image prior with conjugate Gaussian-linear model error bars and Gaussian surrogate for TV regularisation.
result Method provides superior calibration of uncertainty estimates.

We consider the problem of reconstructing a signal from multi-layered (possibly) non-linear measurements. Using non-rigorous but standard methods from statistical physics we present the Multi-Layer Approximate Message Passing (ML-AMP) algorithm for computing marginal probabilities of the corresponding estimation proble…

2017-01-24abs ↗pdf ↗

The paper improves GP regression for sparse sensor data in structural mode shape reconstruction.

problem Reconstructing full-field structural mode shapes from sparse sensor data.
method Physics-Constrained Single-Output Gaussian Process (CONS-SOGP) framework.
result The proposed method provides more accurate and reliable mode shapes.

Recent advances in high-throughput cDNA sequencing (RNA-Seq) technology have revolutionized transcriptome studies. A major motivation for RNA-Seq is to map the structure of expressed transcripts at nucleotide resolution. With accurate computational tools for transcript reconstruction, this technology may also become us…

2013-09-20abs ↗pdf ↗

Estimates joint probability distribution from 1-way marginals using low-rank tensors and random projections.

problem Nonparametric estimation of joint probability mass function (PMF) from limited data.
method Low-rank tensor decomposition and random projections to link data to PMF estimation.
result Estimates joint density from 1-way marginals using transformed space and novel algorithm.

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.

ITF improves DSR but inflates curvature, while marginal likelihood reduces it, affecting QoIs.

problem Curvature mismatch between teacher forcing and marginal likelihood in chaotic dynamical systems.
method Comparing objective-induced curvatures of ITF and marginal likelihood in a probabilistic switching augmentation of AL-RNNs.
result Curvature inflation by ITF and reduction by marginal likelihood affect dynamical quantities of interest.

Improved phylogenetic tree reconstruction using flexible branch length distributions.

problem Inefficient Markov chain Monte Carlo methods for large sequence datasets.
method Variational Bayesian phylogenetic inference with semi-implicit branch length distributions.
result Proposed method improves marginal likelihood estimation and branch length posterior approximation.

Node embeddings have become an ubiquitous technique for representing graph data in a low dimensional space. Graph autoencoders, as one of the widely adapted deep models, have been proposed to learn graph embeddings in an unsupervised way by minimizing the reconstruction error for the graph data. However, its reconstruc…

2019-08-12abs ↗pdf ↗

In text mining, information retrieval, and machine learning, text documents are commonly represented through variants of sparse Bag of Words (sBoW) vectors (e.g. TF-IDF). Although simple and intuitive, sBoW style representations suffer from their inherent over-sparsity and fail to capture word-level synonymy and polyse…

2013-01-28abs ↗pdf ↗

New method reconstructs non-equilibrium stochastic systems from data.

problem Reconstructing non-equilibrium stochastic systems from ensemble measurements.
method Schrödinger bridge problem with multivariate Ornstein-Uhlenbeck process.
result Simulation-free algorithm achieves higher accuracy than competing methods.

We study the structure of locational marginal prices in day-ahead and real-time wholesale electricity markets. In particular, we consider the case of two North American markets and show that the price correlations contain information on the locational structure of the grid. We study various clustering methods and intro…

2017-10-31abs ↗pdf ↗

We consider the inverse problem of reconstructing the posterior measure over the trajec- tories of a diffusion process from discrete time observations and continuous time constraints. We cast the problem in a Bayesian framework and derive approximations to the posterior distributions of single time marginals using vari…

2015-12-18abs ↗pdf ↗

Graph embedding is an effective method to represent graph data in a low dimensional space for graph analytics. Most existing embedding algorithms typically focus on preserving the topological structure or minimizing the reconstruction errors of graph data, but they have mostly ignored the data distribution of the laten…

2018-02-13abs ↗pdf ↗

Incorporating deep neural networks in image compressive sensing (CS) receives intensive attentions in multimedia technology and applications recently. As deep network approaches learn the inverse mapping directly from the CS measurements, the reconstruction speed is significantly faster than the conventional CS algorit…

2019-08-28abs ↗pdf ↗

BiDVL improves EBLVMs for visual tasks by optimizing two variational distributions.

problem Training EBLVMs is challenging due to intractable distributions.
method Bi-level doubly variational learning with two tractable distributions.
result BiDVL achieves impressive image generation and reconstruction performance.

We consider the classical sparse regression problem of recovering a sparse signal x0x_0 given a measurement vector y=Φx0+wy = Φx_0+w. We propose a tree search algorithm driven by the deep neural network for sparse regression (TSN). TSN improves the signal reconstruction performance of the deep neural network designed for sp…

2019-04-01abs ↗pdf ↗

A deep generative model improves imputation of MNAR data by treating missing and complete data equally.

problem Missing Not At Random (MNAR) data in analysis.
method A generative model-specific joint probability decomposition method (conjunction model) and a deep generative imputation model (GNR).
result GNR surpasses state-of-the-art MNAR baselines with significant margins in RMSE and better mask reconstruction.

New methods optimize sums of bivariate functions on finite domains.

problem Optimizing functions with multiple arguments that are sums of bivariate functions.
method Measure-valued extensions, 2\ell^2-approximation, entropy-regularization, linear programming, coordinate ascent.
result Tractable problem formulations solvable with various methods.

New insights explain why ββ-VAEs fail at disentanglement.

problem Disentanglement performance of ββ-VAEs peaks at intermediate ββ and collapses as regularization increases.
method Formalized information-theoretic mechanism, introduced λβλβ-VAE to stabilize disentanglement.
result Strong regularization pressure leads to mutual information collapse in ββ-VAEs.

DeepDIVE disentangles input into marginal and conditional distributions for multi-task learning.

problem Challenges in multi-task learning due to conflicting objectives.
method Inspired by probability theory, DeepDIVE uses a variational autoencoder with disentangled features and cross-attention mechanism.
result DeepDIVE disentangles input and improves forecast accuracy compared to baseline models.

DEUA detects diffusion-generated images by accounting for different types of uncertainty.

problem Detecting generated images with varying aleatoric and epistemic uncertainty.
method DEUA framework using Laplace approximation for DEU estimation and asymmetric loss function.
result DEUA achieves state-of-the-art performance on large-scale benchmarks.

Paper proposes ManiF-SMC for effective approximate machine unlearning.

problem Limited unlearning effectiveness and potential to undermine original learning objectives.
method Reformulates approximate unlearning as pushing erased samples towards semantic neighbors in retained data, using a margin-based triplet loss.
result Achieves unlearning effectiveness comparable to state-of-the-art methods while operating purely in representation space.

This work extends entropic optimal transport to non-product reference couplings, focusing on Gaussian cases.

problem Finding a diffuse coupling between two measures with non-product reference couplings.
method Reduction of the entropic optimal transport problem to a matrix optimization problem.
result Complete description of the solution for non-product reference couplings, including primal and dual variables.

An axiomatic approach to signal reconstruction is formulated, involving a sample consistent set and a guiding set, describing desired reconstructions. New frame-less reconstruction methods are proposed, based on a novel concept of a reconstruction set, defined as a shortest pathway between the sample consistent set and…

2017-02-02abs ↗pdf ↗

Recent work in unsupervised representation learning has focused on learning deep directed latent-variable models. Fitting these models by maximizing the marginal likelihood or evidence is typically intractable, thus a common approximation is to maximize the evidence lower bound (ELBO) instead. However, maximum likeliho…

2017-11-01abs ↗pdf ↗

We focus on an interpolation method referred to Bayesian reconstruction in this paper. Whereas in standard interpolation methods missing data are interpolated deterministically, in Bayesian reconstruction, missing data are interpolated probabilistically using a Bayesian treatment. In this paper, we address the framewor…

2014-04-23abs ↗pdf ↗