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

Trend · papers per month

55111166221 · Jun 202019922001200920172026
48 results for synthetic filtering

TASC improves synthetic control for time-series data with trends.

problem Inability of existing SC methods to fully utilize temporal structure in time-series data.
method TASC uses a state-space model with a constant trend and Kalman filter for counterfactual inference.
result TASC offers advantages in settings with strong temporal trends and high observation noise.

In this paper we formally analyse the use of sparse filtering algorithms to perform covariate shift adaptation. We provide a theoretical analysis of sparse filtering by evaluating the conditions required to perform covariate shift adaptation. We prove that sparse filtering can perform adaptation only if the conditional…

2016-07-22abs ↗pdf ↗

Proposes a GNN for multivariate time-series prediction with filtering.

problem Low signal-to-noise ratio in complex systems data.
method Integrates a spatial-temporal GNN with a matrix filtering module to generate filtered graphs.
result Proposed model outperforms baseline approaches in multivariate time-series prediction.

We study fairness in collaborative-filtering recommender systems, which are sensitive to discrimination that exists in historical data. Biased data can lead collaborative-filtering methods to make unfair predictions for users from minority groups. We identify the insufficiency of existing fairness metrics and propose f…

2017-05-24abs ↗pdf ↗

A new particle filter avoids resampling to improve state estimation in high dimensions.

problem Particle deprivation in high-dimensional state spaces.
method A resampling-free particle filter designed to mitigate particle deprivation.
result The filter offers a near-accurate representation of the posterior distribution in high-dimensional contexts.

This paper presents a new approach for filter design based on stochastic distances and tests between distributions. A window is defined around each pixel, samples are compared and only those which pass a goodness-of-fit test are used to compute the filtered value. The technique is applied to intensity Synthetic Apertur…

2012-07-03abs ↗pdf ↗

QFIL improves offline RL by filtering data to reduce bias and variance.

problem Improving offline reinforcement learning policies with limited data.
method QFIL uses a filtered dataset to improve policies, trading off bias and variance through quantile selection.
result QFIL provides a safe policy improvement step with function approximation and effectively balances bias and variance.

The parameters of temporal models, such as dynamic Bayesian networks, may be modelled in a Bayesian context as static or atemporal variables that influence transition probabilities at every time step. Particle filters fail for models that include such variables, while methods that use Gibbs sampling of parameter variab…

2013-05-08abs ↗pdf ↗

We propose a Bayesian nonparametric method for low-pass filtering that can naturally handle unevenly-sampled and noise-corrupted observations. The proposed model is constructed as a latent-factor model for time series, where the latent factors are Gaussian processes with non-overlapping spectra. With this construction,…

2019-02-09abs ↗pdf ↗

A drone-based MOT algorithm tracks vehicles using neural network detections and TPMBM filter.

problem Tracking multiple vehicles from drone-mounted cameras.
method Neural network for object detection, TPMBM filter for trajectory estimation, von-Mises Fisher distribution for DOA.
result TPMBM filter optimally estimates vehicle trajectories.

Traditional collaborative filtering (CF) based recommender systems tend to perform poorly when the user-item interactions/ratings are highly scarce. To address this, we propose a learning framework that improves collaborative filtering with a synthetic feedback loop (CF-SFL) to simulate the user feedback. The proposed …

2019-10-21abs ↗pdf ↗

The paper stabilizes PD term structures under forecast uncertainty using a Kalman filter with an anchored observation model.

problem Stable estimation of lifetime PDs under forecast uncertainty.
method Reformulated in state-space framework, introduced an anchored observation model.
result Asymptotic stochastic stability of error dynamics, leading to smoother projections.

Recurrent neural networks (RNNs) have been extraordinarily successful for prediction with sequential data. To tackle highly variable and noisy real-world data, we introduce Particle Filter Recurrent Neural Networks (PF-RNNs), a new RNN family that explicitly models uncertainty in its internal structure: while an RNN re…

2019-05-30abs ↗pdf ↗

Framework uses synthetic data from pretrained models to improve predictive modeling.

problem Limited effectiveness of synthetic data from generative models for improving predictive performance.
method Proposes an end-to-end framework that generates and filters synthetic data through domain-specific statistical methods.
result Consistent improvements in predictive performance across various settings.

A new filter adapts to heavy-tailed data without tuning, improving performance in challenging conditions.

problem Degraded performance of Kalman and EnKF in heavy-tailed distributions.
method Generalizes EnKF using t-distributions, estimating parameters via EM algorithm.
result Improves performance on challenging filtering problems with heavy-tailed noise.

New training algorithm enhances SNNs for temporal signal processing.

problem Lack of robust training algorithms for large-scale SNNs.
method Formulated SNN as IIR filters, proposed training algorithm for optimal synapse filter kernels and weights.
result Model and training algorithm outperform state-of-the-art approaches in accuracy.

Study uses SAR data to map defoliation and regrowth in tundra-forest areas.

problem Mapping defoliation and regrowth in tundra-forest areas using SAR data.
method Novel guided nonlocal means speckle filtering of polarimetric covariance matrix.
result Over 99.7% classification accuracy in defoliation and regrowth mapping.

GenInSAR uses CNNs to filter InSAR phase and estimate coherence without supervision.

problem Improving accuracy in InSAR phase filtering and coherence estimation.
method Unsupervised CNN-based generative model for joint phase filtering and coherence estimation.
result GenInSAR outperforms five related methods in residue reduction and coherence estimation.

In this work we propose a method for learning wavelet filters directly from data. We accomplish this by framing the discrete wavelet transform as a modified convolutional neural network. We introduce an autoencoder wavelet transform network that is trained using gradient descent. We show that the model is capable of le…

2018-02-08abs ↗pdf ↗

This paper addresses the problem of filtering with a state-space model. Standard approaches for filtering assume that a probabilistic model for observations (i.e. the observation model) is given explicitly or at least parametrically. We consider a setting where this assumption is not satisfied; we assume that the knowl…

2013-12-17abs ↗pdf ↗

BALLET filters a high-confidence region of interest for Bayesian optimization.

problem High-dimensional and non-stationary Bayesian optimization challenges.
method Adaptive level-set estimation using two probabilistic models.
result Ballets can efficiently shrink the search space and exhibit tighter regret bounds.

Traditional multi-view learning approaches suffer in the presence of view disagreement,i.e., when samples in each view do not belong to the same class due to view corruption, occlusion or other noise processes. In this paper we present a multi-view learning approach that uses a conditional entropy criterion to detect v…

2012-06-13abs ↗pdf ↗

Proposes a new graph trend filtering model for inhomogeneous graph signals.

problem Estimating piecewise smooth signals over a graph with varying smoothness levels.
method Introduces a l2,0 norm penalized Graph Trend Filtering (GTF) model and two solution methods: spectral decomposition and simulated annealing.
result The GTF model performs better than existing approaches in denoising, support recovery, and semi-supervised classification.

Developed a new method to generate synthetic data while protecting privacy.

problem Protecting privacy of human participant data while making it publicly accessible.
method A multi-step framework based on Classification and Regression Trees and an original distance-based filtering.
result Satisfactory protection against attribute disclosure attacks and formal prevention of membership disclosure attacks.

The paper proposes a method to detect and filter noisy or mislabeled data using pointwise mutual information.

problem Detecting and filtering noisy or mislabeled data in deep learning models.
method A mutual information-based framework quantifying statistical dependencies between inputs and labels.
result The method effectively filters low-quality samples, improving classification accuracy by up to 15%.

Proposes a Gaussian process for graph signals using adaptive spectral kernels.

problem Predicting signals on graph nodes with various structures.
method Spectral kernel learning approach that incorporates a polynomial function in the graph spectral domain.
result The model accurately recovers ground truth spectral filters and outperforms in real-world graph data.

This work studies the denoising of piecewise smooth graph signals that exhibit inhomogeneous levels of smoothness over a graph, where the value at each node can be vector-valued. We extend the graph trend filtering framework to denoising vector-valued graph signals with a family of non-convex regularizers, which exhibi…

2019-05-29abs ↗pdf ↗

New linear denoiser outperforms standard Wiener filter in noisy data.

problem Improving denoising performance for unknown covariance data.
method Synthetically constructed noisy samples to train a linear denoiser using least-squares approximation.
result Optimal denoiser found using the Convex Gaussian Min-Max Theorem (CGMT) for proportional regime.