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

60121181241 · May 202619922001200920172026
48 results for target tracking

This study models target trajectories using stochastic processes for efficient tracking.

problem Efficiently modeling and predicting target trajectories in continuous time.
method Decomposes trajectory modeling into deterministic and stochastic components using Gaussian or Student's-tt processes.
result Demonstrates superior performance in tracking maneuvering targets compared to existing methods.

This paper proposes a DGP approach with UCBs for point target tracking over WSNs.

problem Uncertainty quantification in distributed machine learning-based tracking over WSNs.
method Distributed Gaussian process (DGP) approach with upper confidence bounds (UCBs).
result UCBs provide 88% and 42% higher probability of encompassing true target states in X and Y coordinates, respectively.

SOOTT framework optimizes target tracking with robust and learning-augmented algorithms.

problem Optimizing target tracking in dynamic environments with adversarial perturbations.
method Integrates robust and learning-augmented algorithms for online decision-making.
result CoRT learning-augmented algorithm strictly improves over robust BEST when predictions are accurate.

The tracking method based on the extreme learning machine (ELM) is efficient and effective. ELM randomly generates input weights and biases in the hidden layer, and then calculates and computes the output weights by reducing the iterative solution to the problem of linear equations. Therefore, ELM offers the satisfying…

2018-07-26abs ↗pdf ↗

Bayesian nonparametric models improve tracking in cluttered environments.

problem Robust tracking of moving targets in high clutter environments.
method Employing Bayesian nonparametric models to estimate target and clutter measurements.
result Improved tracking performance and effectiveness in high clutter environments.

Develops a universal waveform selection scheme for radar tracking.

problem Optimal waveform selection for target tracking in active sensors.
method Uses reinforcement learning and universal source coding techniques.
result Achieves optimal waveform selection for any radar scene modeled as a Markov process.

Method improves volatility targeting for index construction.

problem High turnover, leverage spikes, and sensitivity to estimation error in existing volatility-targeting strategies.
method Proportional-control approach for setting index weights that corrects tracking error through feedback.
result The proportional-control approach achieves the target volatility more effectively than open-loop alternatives.

Robust visual tracking for long video sequences is a research area that has many important applications. The main challenges include how the target image can be modeled and how this model can be updated. In this paper, we model the target using a covariance descriptor, as this descriptor is robust to problems such as p…

2013-03-24abs ↗pdf ↗

In target tracking, the estimation of an unknown weaving target frequency is crucial for improving the miss distance. The estimation process is commonly carried out in a Kalman framework. The objective of this paper is to examine the potential of using neural networks in target tracking applications. To that end, we pr…

2018-06-13abs ↗pdf ↗

Enhances particle filters with neural augmentation for multi-sub-state tracking.

problem Particle filters struggle with complex or approximated models and low latency requirements.
method Learning Flock (LF) uses a neural network to correct particle weights based on sub-particle relationships.
result LF improves performance, robustness, and latency in radar multi-target tracking.

We study the competition of two strategic agents for liquidity in the benchmark portfolio tracking setup of Bank, Soner, Voß (2017). Specifically, both agents track their own stochastic running trading targets while interacting through common aggregated temporary and permanent price impact à la Almgren and Chriss (2001…

2019-11-12abs ↗pdf ↗

Quantum computing tackles non-convex portfolio optimization with cardinality constraints.

problem Non-convex portfolio optimization problems in asset management.
method Application of quantum annealing with non-linear cardinality constraints.
result Quantum portfolio optimization yields smaller, more profitable portfolios.

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.

Improved FDR control for sparse financial index tracking.

problem Maintaining FDR control in high-dimensional financial data with strong variable dependencies.
method Expanding T-Rex framework to handle overlapping groups of correlated variables with nearest neighbors penalization.
result Accurately tracks the S&P 500 index using only a small number of stocks.

Graph neural networks improve charged particle tracking on FPGAs.

problem Charged particle trajectory determination in high interaction density conditions.
method Graph neural networks (GNNs) embedded in tracker data as graphs, classifying edges as track segments.
result GNNs implemented on FPGAs for charged particle tracking, enabling future HL-LHC experiments.

Computing the permanent of a non-negative matrix is a core problem with practical applications ranging from target tracking to statistical thermodynamics. However, this problem is also #P-complete, which leaves little hope for finding an exact solution that can be computed efficiently. While the problem admits a fully …

2019-11-26abs ↗pdf ↗

We develop a methodology for index tracking and risk exposure control using financial derivatives. Under a continuous-time diffusion framework for price evolution, we present a pathwise approach to construct dynamic portfolios of derivatives in order to gain exposure to an index and/or market factors that may be not di…

2017-05-30abs ↗pdf ↗

Commodity exchange-traded funds (ETFs) are a significant part of the rapidly growing ETF market. They have become popular in recent years as they provide investors access to a great variety of commodities, ranging from precious metals to building materials, and from oil and gas to agricultural products. In this article…

2016-10-28abs ↗pdf ↗

New algorithm infers trajectories from partial observations using optimal transport.

problem Inferring trajectories from partial observations of coupled systems.
method Extends MFL algorithm to latent SDEs using observable state space models and partial observations.
result Experiments show significant outperformance over latent-free baseline.

New method uses adiabatic principles to improve ground-state preparation in quantum computing.

problem Challenges in variational training of complex energy landscapes.
method Iterative Hamiltonian deformation complemented with adiabatic principles.
result Consistent convergence to target ground state through sequence of intermediate problems.

Most real-world networks exhibit community structure, a phenomenon characterized by existence of node clusters whose intra-edge connectivity is stronger than edge connectivities between nodes belonging to different clusters. In addition to facilitating a better understanding of network behavior, community detection fin…

2015-06-25abs ↗pdf ↗

DIGing-SGLD improves SGLD for scalable Bayesian learning in dynamic networks.

problem Scalable Bayesian learning in multi-agent systems with time-varying networks.
method Integrates Langevin sampling with gradient-tracking for decentralized learning over time-varying networks.
result Achieves geometric convergence to the target distribution with finite-time guarantees.

FPI methods compute barycenters of Gaussian sets for various dissimilarity measures.

problem Efficiently compute barycenters of Gaussian sets for multiple dissimilarity measures.
method Fixed-Point Iterations (FPI) for several dissimilarity measures.
result FPI provides a useful toolbox for fusion/reduction of Gaussian sets.

This paper solves the normalizability crisis in sequential inference by introducing bounded information geometry.

problem Structural failure in standard sequential inference architectures when dealing with extreme outliers.
method Non-parametric field actions and bounded information geometry to truncate infinite tails of spatial distributions.
result Empirical benchmarks across three domains show robust estimation without infinite-tailed distributional assumptions.

We consider the problem of hedging a European contingent claim in a Bachelier model with transient price impact as proposed by Almgren and Chriss. Following the approach of Rogers and Singh and Naujokat and Westray, the hedging problem can be regarded as a cost optimal tracking problem of the frictionless hedging strat…

2015-10-12abs ↗pdf ↗

Gradient filters track moving parameters under noisy data and misspecification.

problem Tracking multidimensional time-varying parameters under noisy observations and model misspecification.
method Gradient-based filters update parameters using the gradient of a postulated objective function, evaluated at either the predicted or updated parameters.
result Novel sufficient conditions for exponential stability of the filtered parameter path, and finite-sample and asymptotic mean squared error bounds.

Applications of safety, security, and rescue in robotics, such as multi-robot target tracking, involve the execution of information acquisition tasks by teams of mobile robots. However, in failure-prone or adversarial environments, robots get attacked, their communication channels get jammed, and their sensors may fail…

2018-03-26abs ↗pdf ↗