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

142283425566 · Jun 202019922001200920172026
48 results for distributed tracking

High-probability bound for distributed stochastic approximation tracking error.

problem Analyzing the convergence of distributed stochastic approximation schemes.
method Analysis using ODE approach to stochastic approximation.
result High probability bound for tracking error between iterates and limiting differential equation.

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.

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 ↗

Index tracking is a popular form of asset management. Typically, a quadratic function is used to define the tracking error of a portfolio and the look back approach is applied to solve the index tracking problem. We argue that a forward looking approach is more suitable, whereby the tracking error is expressed as expec…

2019-08-21abs ↗pdf ↗

Bayesian approach for constructing and rebalancing sparse index-tracking portfolios.

problem Sparse tracking of a reference index with uncertainty quantification.
method Sparse linear regression with Laplace prior, empirical-Bayes calibration, Langevin-type MCMC, threshold-based rules.
result Posterior uncertainty on tracking error, portfolio composition, and rebalancing moves.

We propose a computationally efficient random walk on a convex body which rapidly mixes and closely tracks a time-varying log-concave distribution. We develop general theoretical guarantees on the required number of steps; this number can be calculated on the fly according to the distance from and the shape of the next…

2013-09-23abs ↗pdf ↗

New algorithm tackles optimization with distributed constraints.

problem Optimization problems with generalized orthogonality constraints in a decentralized setting.
method Introduced a novel algorithm that tracks gradients and Jacobians simultaneously.
result Global convergence with an iteration complexity established.

The paper analyzes Adam and SGD in nonstationary optimization, revealing tradeoffs between noise and drift.

problem Analyzing Adam and SGD in nonstationary optimization problems.
method Theoretical analysis of Adam and SGD under non-stationary stochastic objectives, separating two regimes.
result Characterizes the tradeoff between noise and drift in Adam and SGD, revealing when adaptive step-sizing is beneficial or harmful.

In this paper, we study the problem of distributed multi-agent optimization over a network, where each agent possesses a local cost function that is smooth and strongly convex. The global objective is to find a common solution that minimizes the average of all cost functions. Assuming agents only have access to unbiase…

2018-05-25abs ↗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.

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 ↗

Momentum SGD fails to track nonstationary optima due to drift amplification.

problem Tracking nonstationary optima in stochastic optimization.
method Theoretical analysis of SGD and momentum variants under strong convexity and smoothness.
result Momentum incurs a drift-amplification penalty that diverges as the momentum parameter approaches 1, leading to systematic lag.

Optimizes decisions in time-varying distributions using online stochastic methods and Wasserstein distance.

problem Optimizing decisions in time-varying distributions using Wasserstein distance.
method Online proximal-gradient method, exact penalty method, constraint-tightening approach.
result Dynamic regret bounds for tracking and estimation error.

THRML uses energy-based models for index tracking, reducing portfolio tracking error and improving returns.

problem NP-hard combinatorial optimization in portfolio optimization under cardinality constraints.
method THRML reformulates index tracking as probabilistic inference on an Ising Hamiltonian, using GPU-accelerated block Gibbs sampling.
result THRML achieves 4.31 percent annualized tracking error compared to 5.66-6.30 percent for baselines, with 128.63 percent total return.

NBF combines deep learning with classical filtering for better belief tracking.

problem Maintaining distributions over hidden states in partially observable systems.
method Trains neural networks to map beliefs to fixed-length vectors, updating them with incoming observations and dynamics.
result NBF efficiently tracks shifting, multimodal beliefs without particle impoverishment.

A new method for distributed optimization with noisy function evaluations.

problem Distributed optimization with noisy function evaluations.
method Zero-order one-point estimate with distributed stochastic gradient-tracking technique.
result The method converges almost surely to the optimum with a rate of O(1k)O(\frac{1}{\sqrt{k}}).

Deployment of machine learning (ML) algorithms in production for extended periods of time has uncovered new challenges such as monitoring and management of real-time prediction quality of a model in the absence of labels. However, such tracking is imperative to prevent catastrophic business outcomes resulting from inco…

2019-02-07abs ↗pdf ↗

New framework for tracking varying bounds in time series forecasting.

problem Forecasting bounded time series with varying bounds.
method Extended log-likelihood estimation, online maximum likelihood estimation, Normalized Gradient Descent (NGD) for quasiconvex optimization.
result Derive an Online Normalized Gradient Descent algorithm for online bound tracking.

A novel decentralized algorithm improves minimax optimization in federated learning.

problem Minimax optimization in federated learning with data heterogeneity.
method Decentralized Gradient Tracking (K-GT-Minimax) for nonconvex-strongly-concave optimization.
result Demonstrates superior convergence rate for NC-SC minimax optimization.

A new algorithm improves sample complexity for thresholding in Monte Carlo Tree Search.

problem Determining if the root node value of a tree is at least a given threshold.
method Developed a δ-correct sequential sampling algorithm based on the Track-and-Stop strategy.
result Ratio-based modification of D-Tracking strategy reduces sample complexity and computational cost.

This work uses SVM to identify track component failures in AC Track Circuits.

problem Detecting and identifying specific track component failures in AC Track Circuits.
method Applied SVM classifier to STDS track circuit data.
result Successfully classified 15 different track component failures.

New method uses cluster shapes to improve track finding in particle collisions.

problem Combining timing and additional detector information for efficient track finding.
method Neural networks to analyze cluster shapes for track seeding.
result Cluster shapes reduce fake combinatorial backgrounds while maintaining high track efficiency.

Bayesian deep learning improves seismic imaging uncertainty.

problem Uncertainty in seismic imaging due to data noise and linearization errors.
method Combines Bayesian inference and deep neural networks to quantify uncertainty in horizon tracking.
result Uncertainty in automatically tracked horizons can be quantified and visualized.

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.

This paper optimizes object tracking on edge devices with small matrices.

problem Efficiently tracking objects in video sequences on edge devices with small matrices.
method Parallelized a Simple Online and Real-time Tracking (SORT) application on shared-memory multicores.
result Throughput-based parallelization technique outperforms multi-threading for small matrices.

Bayesian approach models match and non-match score distributions over continuous covariates.

problem Complex evaluation of model performance over continuous covariates in biometric verification.
method Generative model of score distributions, mixture models, local basis functions, Bayesian inference.
result Accurate and effective method for studying model performance over continuous covariates.

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 present a Kalman smoothing framework based on modeling errors using the heavy tailed Student's t distribution, along with algorithms, convergence theory, open-source general implementation, and several important applications. The computational effort per iteration grows linearly with the length of the time series, a…

2013-03-22abs ↗pdf ↗

Paper introduces TAP-Vid, a benchmark for tracking any point in videos.

problem Tackles the problem of tracking arbitrary physical points on surfaces over longer video clips.
method Formalizes the problem as TAP, introduces TAP-Vid benchmark, uses crowdsourced pipeline with optical flow estimates, proposes TAP-Net model.
result TAP-Net outperforms all prior methods on TAP-Vid benchmark when trained on synthetic data.