RL approach for target tracking with unknown dynamics and sensor control.
problem Tracking an unknown target with sensor control.
method Track-MDP formulation for RL, compared with POMDP.
result Optimal RL policy tracks all target paths with certainty.
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.
We study a series of static and dynamic portfolios of VIX futures and their effectiveness to track the VIX index. We derive each portfolio using optimization methods, and evaluate its tracking performance from both empirical and theoretical perspectives. Among our results, we show that static portfolios of different VI…
Online learners track optimal solutions with constant step-size.
problem Tracking optimal solutions in online learning settings.
method Established a link between steady-state performance and tracking performance using analogies with adaptive filters.
result Inferred tracking performance from steady-state expressions directly.
In this work, we study the robust subspace tracking (RST) problem and obtain one of the first two provable guarantees for it. The goal of RST is to track sequentially arriving data vectors that lie in a slowly changing low-dimensional subspace, while being robust to corruption by additive sparse outliers. It can also b…
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…
Hybrid quantum-classical method optimizes financial index tracking.
problem Optimizing asset weights for financial index replication.
method Hybrid quantum-classical optimization with pruning algorithm.
result Improved performance through quantum and classical optimization.
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.
This paper reviews and analyzes various modeling approaches for financial index tracking.
problem Efficient replication of market index performance in financial markets.
method Categorization into three frameworks: optimization, statistical, and machine learning; empirical study on S&P 500 dataset.
result Optimization-based models deliver the most precise index tracking, statistical-based models achieve the strongest return-risk balance, and data-driven models provide competitive performance.
Extends tracking guarantees for time-varying variational inequalities.
problem Tracking solutions of time-varying variational inequalities.
method Extends existing results to sublinear solution paths and periodic problems.
result Discrete dynamical systems of periodic time-varying VI can exhibit chaotic behavior or converge to the solution.
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.
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.
New data-driven Cartan connection tracks complex vascular structures.
problem Tracking complex vascular structures in multi-orientation images.
method Formulated a data-driven Cartan connection on M2 for geodesic tracking. result Improved geodesic tracking of vascular trees with globally optimal curves.
Hybrid SA algorithm optimizes index tracking for large indices.
problem Optimizing index tracking for large indices with financial constraints.
method Hybrid simulated annealing algorithm.
result Algorithm finds optimal solutions for past and future returns.
Optimizes sliding window approach for tracking Gaussian densities.
problem Improving tracking performance of Gaussian density estimation.
method Theoretical analysis of sliding window Gaussian Kernel Density Estimators.
result Empirical evidence shows improved tracking performance with optimal weight sequence.
Study examines CSO algorithm for 3D swarming and tracking multiple targets.
problem Simulating and tracking multiple targets in 3D space.
method Cyclic Stochastic Optimization (CSO) algorithm implemented by mobile sensing agents.
result CSO algorithm converges in 3D space, minimizing uncertainty in targets' state estimates.
This paper describes a new online convex optimization method which incorporates a family of candidate dynamical models and establishes novel tracking regret bounds that scale with the comparator's deviation from the best dynamical model in this family. Previous online optimization methods are designed to have a total a…
We propose a long term portfolio management method which takes into account a liability. Our approach is based on the LQG (Linear, Quadratic cost, Gaussian) control problem framework and then the optimal portfolio strategy hedges the liability by directly tracking a benchmark process which represents the liability. Two…
Optimal portfolio tracking with dynamic capital injection into a ratcheting benchmark.
problem Optimizing a portfolio's performance by dynamically adding capital to a non-decreasing benchmark.
method Formulated as an unconstrained control problem with a running maximum cost, transformed into an auxiliary problem with a nonlinear HJB equation, solved using probabilistic representation and stochastic flow analysis.
result Established the existence of a unique classical solution to the HJB equation, providing feedback optimal portfolio strategies.
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.
The Long Short-Term Memory (LSTM) neural network based data association algorithm named as DeepDA for multi-target tracking in clutters is proposed to deal with the NP-hard combinatorial optimization problem in this paper. Different from the classical data association methods involving complex models and accurate prior…
This paper optimizes portfolio selection by penalizing tracking error, improving Sharpe ratio.
problem Optimizing portfolio allocation with a penalty for deviation from a reference portfolio.
method Formulated as a McKean-Vlasov control problem, provides explicit solutions and asymptotic expansions.
result The penalized portfolio strategy outperforms standard mean-variance and reference portfolios in most cases.
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.
This paper studies the empirical tracking performance of leveraged ETFs on gold, and their price relationships with gold spot and futures. For tracking the gold spot, we find that our optimized portfolios with short-term gold futures are highly effective in replicating prices. The market-traded gold ETF (GLD) also exhi…
The paper analyzes constrained optimal portfolios in high dimensions using novel statistical learning techniques.
problem Forming optimal portfolios with constraints in high-dimensional asset spaces.
method CROWN method integrating factor models with nodewise regression for estimation in large dimensions.
result Demonstrates estimation consistency and convergence rates for constrained portfolio weights, risk, and Sharpe Ratio.
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…
This paper optimizes tracking portfolios in incomplete markets using reinforcement learning.
problem Optimizing tracking portfolios in incomplete markets with capital injection.
method Reinforcement learning approach for optimal control in reflected diffusion processes.
result Satisfactory performance of the q-learning algorithm in numerical examples.
VRSGT algorithm reduces orthogonality constraints in decentralized optimization.
problem Decentralized optimization with orthogonality constraints.
method VRSGT algorithm with variance reduction and orthogonal techniques.
result VRSGT achieves convergence rate of O(1 / k) for orthogonality constraints.
A new model tracks indices without rebalancing, solving NP-hard problems.
problem Tracking indices without rebalancing and minimizing deviations.
method Metaheuristic algorithms and local branching for solving mixed integer linear programming.
result The heuristic generates portfolios that outperform commercial solvers in both in-sample and out-of-sample data.
The paper solves a control problem using reflections to track a benchmark process.
problem Optimal consumption with a benchmark process that grows over time.
method Introduced two auxiliary state processes with reflections to transform the problem into a more tractable form.
result Established the existence of a unique classical solution to the dual PDE.
Unified framework for decentralized optimization combining gradient tracking and variance reduction.
problem Solving finite-sum minimization problems in distributed systems with privacy and resource constraints.
method Unified algorithmic framework combining variance-reduction and gradient tracking.
result Unified methods achieve robust performance and fast convergence for smooth and strongly-convex objectives, and are applicable to non-convex problems.
Fast robust subspace tracking in sparse data-dependent noise with near-optimal delay.
problem Robustly tracking time-varying subspaces in the presence of sparse outliers.
method Introduces a fast mini-batch robust ST solution under mild assumptions.
result Provably correct subspace tracking with near-optimal delay and same time complexity as simple PCA.
Study optimal consumption with relaxed benchmarks and drawdown constraints.
problem Optimal consumption under relaxed benchmark tracking and consumption drawdown constraint.
method Transformed stochastic control problem into regular control problem with state-control constraints, then solved using dual transform and optimal consumption behavior.
result Closed-form solution for optimal investment and consumption in feedback form.
We give a complete characterization of the complexity of best-arm identification in one-parameter bandit problems. We prove a new, tight lower bound on the sample complexity. We propose the `Track-and-Stop' strategy, which we prove to be asymptotically optimal. It consists in a new sampling rule (which tracks the optim…
Study efficient rebalancing strategies for portfolio tracking error.
problem Optimizing portfolio rebalancing under high-frequency asset price models.
method Discrete-time rebalancing strategies derived from continuous model.
result Asymptotically efficient sequence of simple strategies.
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.
New framework tracks communities in dynamic networks.
problem Discovering and tracking communities in evolving networks.
method Spectral framework on Grassmann manifold for subspace tracking.
result Improved dynamic community detection results across various network types.
Hybrid approach combines transformer and Bayesian filtering for robust multiple particle tracking.
problem Challenges in tracking multiple particles in noisy scenes due to combinatorial explosion of hypotheses.
method Attention-Bayesian hybrid framework using transformer for association and Bayesian filtering for pruning hypotheses.
result Improved tracking accuracy and robustness against spurious detections.
This paper optimizes decarbonized indices for financial tracking, balancing risk and environmental impact.
problem Balancing financial performance with environmental responsibilities in the context of climate risks.
method Develops decarbonized indices using mean-VaR and mean-ES optimization methods.
result Optimized indices reduce financial risk and carbon footprint, providing a balanced investment option.
The paper extends Merton's problem by adding benchmark tracking, finding optimal strategies.
problem Maximizing consumption utility with a trade-off against benchmark performance.
method Developed a convex duality theorem and derived optimal strategies for specific cases.
result Found optimal portfolio and consumption strategies for CRRA utility and geometric Brownian motion benchmarks.
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.
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.
Optimal text-based indices track VIX and inflation.
problem Maximizing contemporaneous relation or predictive performance with target variables.
method Optimizing text-based indices focusing on VIX and inflation expectations.
result Superior performance compared to existing indices.
We consider the problem of tracking a target whose dynamics is modeled by a continuous Itō semi-martingale. The aim is to minimize both deviation from the target and tracking efforts. We establish the existence of asymptotic lower bounds for this problem, depending on the cost structure. These lower bounds can be relat…
Portfolio management problems are often divided into two types: active and passive, where the objective is to outperform and track a preselected benchmark, respectively. Here, we formulate and solve a dynamic asset allocation problem that combines these two objectives in a unified framework. We look to maximize the exp…
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.
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.
This research develops a dual-level reinforcement learning strategy to track daily VWAP accurately.
problem Inaccurate tracking of daily VWAP due to short trading horizons.
method Dual-level architecture using Transformer and LSTM models.
result Improves accuracy in approximating daily VWAP compared to previous models.