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

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for Feature Reconstruction

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.

A novel method for feature selection using a reparameterized logitNormal distribution.

problem Feature selection for reconstruction in high-dimensional data.
method Introducing a reparameterization of the logitNormal distribution to address differentiability and covariance issues.
result The method provides an effective exploration scheme and efficient feature selection for reconstruction.

Reconstructing signature features from randomized vector fields in differential equations.

problem Reconstructing signature features from controlled differential equations with random vector fields.
method Using controlled ordinary differential equations driven by continuous bounded variation curves, the study explores the extent to which signature features can be reconstructed from the non-linear flow of these equations.
result The number of signature features that can be reconstructed from the non-linear flow of controlled ordinary differential equations with random vector fields is exponential in the hidden dimension, under certain conditions.

Mask-reconstruction pretraining helps in downstream tasks by capturing more semantic features.

problem How mask-reconstruction pretraining helps in downstream tasks and why it surpasses supervised learning.
method Theoretical analysis and experimental validation of mask-reconstruction pretraining (MRP) on auto-encoders.
result MRP provably captures more semantic features than supervised learning, leading to better performance in downstream tasks.

Empirical data on real complex systems are becoming increasingly available. Parallel to this is the need for new methods of reconstructing (inferring) the topology of networks from time-resolved observations of their node-dynamics. The methods based on physical insights often rely on strong assumptions about the proper…

2019-02-11abs ↗pdf ↗

Reconstruction-based learning produces uninformative features for perception tasks.

problem Misalignment between reconstruction-based learning and perception tasks.
method Investigated the impact of input space reconstruction on feature learning for perception tasks.
result Reconstruction-based learning allocates model capacity to a subspace with uninformative features for perception tasks.

Topology-enhanced loss improves 3D object reconstruction from 2D images.

problem Challenges in reconstructing 3D objects from 2D images, especially capturing shape information.
method Integrates multi-scale topological features into the reconstruction loss using cubical complexes and optimal transport distance.
result Topology-aware loss substantially improves 3D reconstruction quality.

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 ↗

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 ↗

This paper is first-line research expanding GANs into graph topology analysis. By leveraging the hierarchical connectivity structure of a graph, we have demonstrated that generative adversarial networks (GANs) can successfully capture topological features of any arbitrary graph, and rank edge sets by different stages a…

2017-07-19abs ↗pdf ↗

New method reconstructs missing variables in time series using autoencoders and automatic differentiation.

problem Reconstruct missing variables in time series with flexible input and output combinations.
method Train an autoencoder with all features, optimize missing variables as inputs, and use automatic differentiation.
result Flexible input and output combinations can be achieved without retraining the autoencoder.

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.

This paper presents a learning method for convolutional autoencoders (CAEs) for extracting features from images. CAEs can be obtained by utilizing convolutional neural networks to learn an approximation to the identity function in an unsupervised manner. The loss function based on the pixel loss (PL) that is the mean s…

2018-06-06abs ↗pdf ↗

Paper tackles model vulnerabilities by reconstructing training data.

problem Reconstructing training data from model parameters poses a security risk.
method Developed a mathematical framework and score matching method for both Bayesian and non-Bayesian models.
result First score matching framework for reconstructing data in Bayesian models.

This work interprets SFA through variational inference, relaxing linearity constraints.

problem Recover non-linear SFA from variational inference.
method Probabilistic interpretation of SFA through variational inference, relaxing linearity constraints.
result Reinterprets SFA as a variational framework, allowing slowness as a regularizer to reconstruction loss.

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 ↗

This paper proposes a method to train multiple neural networks with shared parameters using a reconstruction loss.

problem Training multiple neural networks for correlated tasks separately is inefficient.
method Introduces a novel approach with a reconstruction loss to encourage shared features across multiple tasks.
result The proposed method achieves efficient transfer learning with competitive performance.

A new faster neural network training method using backprojection.

problem Training feedforward neural networks more efficiently.
method Projection and reconstruction at each layer to force projected data and reconstructed labels to be similar.
result The proposed method is faster than backpropagation and gives insights into networks.

A new method for feature selection in high-dimensional data.

problem Dealing with noise and high-dimensional data in unsupervised feature selection.
method Sparse PCA via l2,pl_{2,p}-norm regularization, combined with an efficient optimization algorithm.
result The proposed method effectively selects features from real-world data sets.

Biological data including gene expression data are generally high-dimensional and require efficient, generalizable, and scalable machine-learning methods to discover their complex nonlinear patterns. The recent advances in machine learning can be attributed to deep neural networks (DNNs), which excel in various tasks i…

2020-01-23abs ↗pdf ↗

Here, we present a novel approach to solve the problem of reconstructing perceived stimuli from brain responses by combining probabilistic inference with deep learning. Our approach first inverts the linear transformation from latent features to brain responses with maximum a posteriori estimation and then inverts the …

2017-05-19abs ↗pdf ↗

Paper extracts features from time series to improve forecasting accuracy.

problem Forecasting time series generated by Itô-type processes with unknown coefficients.
method Statistical adjustment of mixture-type models to extract features from time series data.
result Additional statistical features enhance time series prediction accuracy.

Paper uses robust GMM to reconstruct missing data in Sentinel-2 images for crop monitoring.

problem Missing data in remote sensing images, especially from multispectral and SAR sensors.
method Robust Gaussian Mixture Models (GMM) with outlier detection using isolation forest.
result Robust GMM outperforms standard GMM in reconstructing imputed values, reducing errors.

A new method extracts features and reconstructs moments in dynamical systems using information geometry.

problem Reconstructing moments in dynamical systems efficiently and accurately.
method Information-geometric approach on spaces of probability measures.
result Moments can be expanded in eigenfunctions of a kernel integral operator, enabling nonparametric forecasting.

The field of multiple view geometry has seen tremendous progress in reconstruction and calibration due to methods for extracting reliable point features and key developments in projective geometry. Point features, however, are not available in certain applications and result in unstructured point cloud reconstructions.…

2016-04-27abs ↗pdf ↗

Graph auto-encoder predicts unobserved node features from biological networks and omics data.

problem Integrating biological networks and continuous node features for better prediction.
method Graph neural networks and feature auto-encoders trained on feature reconstruction.
result Graph feature auto-encoder outperforms auto-encoders trained on graph reconstruction for predicting unobserved node features.

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 ↗

This work tackles uncertainty quantification in tomography reconstruction.

problem Ill-posed nature of tomographic reconstruction leading to no unique solution.
method Gaussian process modeling to incorporate prior knowledge and experimental noises.
result Efficient uncertainty quantification in tomographic reconstruction.