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

265177102 · May 202619922001200920172026
48 results for multi-Bernoulli mixture filter

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.

Joint sensing and communication network improves target localization and reduces communication load.

problem Efficiently localize multiple targets with reduced communication overhead.
method Multi-base station cooperative sensing with AI-aided clustering and tracking.
result Optimal sub-pattern assignment (OSPA) error less than 60 cm with reduced communication capacity.

This paper addresses the mapping problem. Using a conjugate prior form, we derive the exact theoretical batch multi-object posterior density of the map given a set of measurements. The landmarks in the map are modeled as extended objects, and the measurements are described as a Poisson process, conditioned on the map. …

2018-11-07abs ↗pdf ↗

Bayesian methods improve tracking multiple objects through dynamic dependencies.

problem Tracking multiple objects with time-varying cardinality and unordered measurements.
method Employing Bayesian nonparametric models, specifically dependent Dirichlet and Pitman-Yor processes, for state estimation and Monte Carlo sampling for trajectory learning.
result The proposed methods outperform existing algorithms in estimating the time-varying number of objects and identifying object associations.

EnEMF uses Epanechnikov kernel for high-dimensional filtering, improving accuracy and robustness.

problem Suboptimal Gaussian mixture kernel density estimates in high-dimensional settings.
method Ensemble Epanechnikov mixture filter (EnEMF) using optimal Epanechnikov kernel.
result EnEMF reduces error per particle on high-dimensional systems like Lorenz '96.

A Bayesian filtering algorithm is developed for a class of state-space systems that can be modelled via Gaussian mixtures. In general, the exact solution to this filtering problem involves an exponential growth in the number of mixture terms and this is handled here by utilising a Gaussian mixture reduction step after …

2017-05-16abs ↗pdf ↗

Appropriately designing the proposal kernel of particle filters is an issue of significant importance, since a bad choice may lead to deterioration of the particle sample and, consequently, waste of computational power. In this paper we introduce a novel algorithm adaptively approximating the so-called optimal proposal…

2011-08-14abs ↗pdf ↗

Numerous kinds of uncertainties may affect an economy, e.g. economic, political, and environmental ones. We model the aggregate impact by the uncertainties on an economy and its associated financial market by randomised mixtures of Lévy processes. We assume that market participants observe the randomised mixtures only …

2011-12-09abs ↗pdf ↗

A novel optimization-based Gaussian mixture reduction method using composite transportation divergence.

problem Exponential increase in Gaussian mixture order leads to intractable inference.
method Optimization-based Gaussian mixture reduction (GMR) using composite transportation divergence (CTD).
result Unified framework for selecting optimal cost function in various applications.

A new method learns state and proposal dynamics in state-space models using neural networks.

problem Inference in non-linear state-space models.
method StateMixNN method using neural networks for proposal and transition distributions.
result Significantly improved recovery of hidden state, especially in highly non-linear scenarios.

Proposes CE-BASS for robust Kalman filtering with innovative and additive outliers.

problem Robustness to both innovative and additive outliers in Kalman filtering.
method Particle mixture Kalman filter with re-sampling of past states.
result CE-BASS efficiently handles multi-modality and trend changes in hidden state distributions.

DFMR improves robustness of learning finite mixture models in distributed settings.

problem Learning finite mixture models in distributed settings with Byzantine failures.
method DFMR leverages pairwise L2 distances to filter and retain local estimates, ensuring robust aggregation.
result DFMR achieves optimal convergence rate and asymptotic equivalence to global maximum likelihood estimate.

A new method for Gaussian filtering using gradient flows and Wasserstein metrics.

problem Approximating Gaussian and mixture-of-Gaussians filtering for complex systems.
method Variational approximation via gradient-flow representation on Wasserstein metric space.
result Competitive performance in posterior representation and parameter estimation for systems with multiplicative noise and multi-modal distributions.

Proposes M-CHMM for robust modeling of multivariate healthcare time series.

problem Challenges in analyzing multivariate healthcare time series data.
method Mixture of coupled hidden Markov models (M-CHMM) with two sampling algorithms.
result Improves data fit, handles missing and noisy measurements, and enhances prediction accuracy.

Paper develops an online EM algorithm for graph signal inference from streaming data.

problem Joint inference and clustering of graph signals with non-white excitation.
method Mixture model with low-rank plus sparse prior, online EM algorithm.
result Proposed online EM algorithm converges to MAP solution.

PFPN uses particle filtering to improve character control in physics-based simulations.

problem Premature commitment to suboptimal actions in high-dimensional continuous control problems for articulated characters.
method Proposes a particle-based action policy using particle filtering to dynamically explore and discretize the action space.
result Demonstrates better imitation performance and robustness to external perturbations compared to Gaussian policies.

New method improves generative model performance by fully conditioning variational posteriors.

problem Inaccurate inference due to partial conditioning of variational posteriors in sequential LVMs.
method Introduces fully-conditioned approximate posteriors to improve generative model performance.
result Improves generative modelling and multi-step prediction performance.

It was recently shown that neural ordinary differential equation models cannot solve fundamental and seemingly straightforward tasks even with high-capacity vector field representations. This paper introduces two other fundamental tasks to the set that baseline methods cannot solve, and proposes mixtures of stochastic …

2019-05-23abs ↗pdf ↗

The paper combines supervised and unsupervised learning to predict financial market movements.

problem Predicting profitable opportunities in financial markets using machine learning.
method The paper uses linear models and Gaussian Mixture Models (GMM) to extract features from Bitcoin, Pepecoin, and Nasdaq markets.
result GMM filtering improved the performance of KNN and RF algorithms, leading to higher average returns.

The vast majority of the neural network literature focuses on predicting point values for a given set of response variables, conditioned on a feature vector. In many cases we need to model the full joint conditional distribution over the response variables rather than simply making point predictions. In this paper, we …

2016-06-07abs ↗pdf ↗

This research detects and identifies human-made objects in 3D point clouds using novel methods.

problem Detect and identify human-made objects in 3D point clouds.
method Ground filtering, local information extraction, clustering using Marked Point Fields (MPFs) and Hessian matrix.
result The proposed method outperforms previous techniques in detecting human-made objects.

Learning representation on graph plays a crucial role in numerous tasks of pattern recognition. Different from grid-shaped images/videos, on which local convolution kernels can be lattices, however, graphs are fully coordinate-free on vertices and edges. In this work, we propose a Gaussian-induced convolution (GIC) fra…

2018-11-11abs ↗pdf ↗

We propose a Fourier-based approach for optimization of several clustering algorithms. Mathematically, clusters data can be described by a density function represented by the Dirac mixture distribution. The density function can be smoothed by applying the Fourier transform and a Gaussian filter. The determination of th…

2019-04-29abs ↗pdf ↗

Paper develops a robust classifier for Gaussian mixture models under sparse adversarial perturbations.

problem Classifying data under sparse adversarial perturbations for Gaussian mixture models.
method Develops FilTrun algorithm with filtration and truncation modules.
result Characterizes optimal robust classifier and robust classification error.