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

112225337449 · Jun 202019922001200920172026
48 results for information filtering

Matched filters reveal optimal normalization methods for different market participants.

problem Optimizing signal extraction from order flow for market microstructure analysis.
method General matched filter principle applied to normalization strategies.
result Optimal normalization methods (e.g., SMCS^{MC} and STVS^{TV}) differ based on trader types.

The paper develops a filtering framework for estimating hazard rates with jumps in financial and insurance applications.

problem Estimating hazard rates with unobservable change-points in financial and insurance contexts.
method Continuous-time filtering framework using progressive enlargement of filtration, stochastic differential equations, and sensitivity analysis.
result Explicit formula for survival probability conditional on partial information.

New algorithm converges to optimal filter for predicting linear dynamical systems.

problem Direct policy search for optimal dynamic filters in partially observable systems.
method Regularizer enforcing informativity over filter states.
result Gradient descent converges to globally optimal solution at rate O(1/T).

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.

We cast Amari's natural gradient in statistical learning as a specific case of Kalman filtering. Namely, applying an extended Kalman filter to estimate a fixed unknown parameter of a probabilistic model from a series of observations, is rigorously equivalent to estimating this parameter via an online stochastic natural…

2017-03-01abs ↗pdf ↗

Kähler information manifolds for signal filters in weighted Hardy spaces are explored.

problem Developing a geometric framework for signal processing filters in weighted Hardy spaces.
method Introducing weighted Hardy spaces and smooth transformations of transfer functions, demonstrating the Kähler manifold structure.
result The Riemannian geometry of weighted Hardy norms for transfer functions forms a Kähler manifold.

Investigates a Kyle model with imperfect information and risk aversion.

problem Tackles a Kyle model with imperfect information and risk-averse informed traders.
method Solves an optimal transport problem and a filtering problem under specific measures.
result Constructs an equilibrium for the Gaussian Kyle model with imperfect information and risk aversion.

EnSF improves accuracy in tracking high-dimensional nonlinear systems.

problem Low accuracy in high-dimensional, nonlinear filtering problems.
method Score-based diffusion model, mini-batch Monte Carlo estimator.
result EnSF outperforms state-of-the-art methods in tracking high-dimensional systems.

A new ensemble filter uses transport maps and MMD optimization for high-dimensional data assimilation.

problem High-dimensional data assimilation challenges in ensemble filtering.
method Optimized Maximum Mean Discrepancy (MMD) for transport map construction.
result Significant improvement in robustness and posterior approximation.

BankGCN improves graph convolution networks by handling multi-channel signals with adaptive filter banks.

problem Handling multi-channel graph signals with limited architectures.
method BankGCN decomposes multi-channel signals into subspaces and uses adapted filters for each subspace.
result BankGCN achieves excellent performance in graph classification on benchmark datasets.

We construct Hodge filtered cohomology groups for complex manifolds that combine the topological information of generalized cohomology theories with geometric data of Hodge filtered holomorphic forms. This theory provides a natural generalization of Deligne cohomology. For smooth complex algebraic varieties, we show th…

2012-12-10abs ↗pdf ↗

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%.

We introduce the variational filtering EM algorithm, a simple, general-purpose method for performing variational inference in dynamical latent variable models using information from only past and present variables, i.e. filtering. The algorithm is derived from the variational objective in the filtering setting and cons…

2018-11-13abs ↗pdf ↗

The ability to track a moving vehicle is of crucial importance in numerous applications. The task has often been approached by the importance sampling technique of particle filters due to its ability to model non-linear and non-Gaussian dynamics, of which a vehicle travelling on a road network is a good example. Partic…

2016-11-15abs ↗pdf ↗

Improved method using filtered PDEs for robust physics-informed deep learning.

problem Complex real-world problems with noisy and sparse data.
method Proposed a surrogate constraint (FPDE) to filter and reduce the influence of noisy and sparse observation data.
result FPDE models converge better and produce higher quality solutions with less data.

The paper develops a computational method for efficient online filtering of diffusion processes.

problem Online filtering of discretely observed nonlinear diffusion processes.
method The approach involves Doob's hh-transforms approximated by solving backward Kolmogorov equations using nonlinear Feynman-Kac formulas and neural networks.
result The proposed method can be orders of magnitude more efficient than state-of-the-art particle filters.

KalmanNet uses neural networks to improve state estimation in systems with unknown dynamics.

problem State estimation of systems with non-linear dynamics and partial information.
method KalmanNet integrates a recurrent neural network with the Kalman filter to handle non-linearities and model mismatches.
result KalmanNet outperforms classic filtering methods in systems with both mismatched and accurate domain knowledge.

We present a filter correlation based model compression approach for deep convolutional neural networks. Our approach iteratively identifies pairs of filters with the largest pairwise correlations and drops one of the filters from each such pair. However, instead of discarding one of the filters from each such pair naï…

2018-11-26abs ↗pdf ↗

Recursive KalmanNet combines neural networks with Kalman filters for precise state estimation.

problem State estimation in systems with noisy measurements and non-Gaussian noise.
method Recursive KalmanNet uses a recurrent neural network to estimate states with consistent error covariance, optimizing for Gaussian negative log-likelihood.
result Recursive KalmanNet outperforms conventional Kalman filters and deep learning-based estimators in non-Gaussian noise conditions.

Proposes a new method to enhance neural learning by maximizing information gain.

problem Improving neural learning by selecting key variables to maximize information gain.
method Adaptive Ensemble Kalman Filter to quantify uncertainty and maximize information gain.
result The proposed method enables the neural network to learn more effectively from stochastic systems.

Recommendation systems have been integrated into the majority of large online systems to filter and rank information according to user profiles. It thus influences the way users interact with the system and, as a consequence, bias the evaluation of the performance of a recommendation algorithm computed using historical…

2015-06-12abs ↗pdf ↗

Collaborative filtering is used to recommend items to a user without requiring a knowledge of the item itself and tends to outperform other techniques. However, collaborative filtering suffers from the cold-start problem, which occurs when an item has not yet been rated or a user has not rated any items. Incorporating …

2014-06-09abs ↗pdf ↗

HLOB predicts mid-price changes in L.O.Bs using deep learning.

problem Forecasting mid-price changes in Limit Order Books.
method HLOB uses a deep learning model with an Information Filtering Network and Homological Convolutional Neural Networks.
result HLOB outperforms state-of-the-art models in real-world datasets.

This paper improves collaborative filtering by integrating user and item embeddings with attention.

problem Sparse ratings and limited robustness of Bayesian methods in collaborative filtering.
method Proposes a VAE-based Bayesian MF framework that leverages both data and embedding information.
result The proposed method enhances robustness and accuracy of collaborative filtering models.

We present a provable, sampling-based approach for generating compact Convolutional Neural Networks (CNNs) by identifying and removing redundant filters from an over-parameterized network. Our algorithm uses a small batch of input data points to assign a saliency score to each filter and constructs an importance sampli…

2019-11-18abs ↗pdf ↗

Study finds non-monotonic Value of Information in dynamic multi-market monopoly.

problem Investigates non-monotonicity in Value of Information for a price-setting monopolist.
method Uses a Bayesian inverse problem with Kalman-Bucy-Stratonovich filter in a dynamic discrete model.
result Non-monotonic relationship between signal variance and Value of Information.