New approach uses Gaussian processes to learn and track complex systems with guaranteed accuracy.
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.
Trend · papers per month
Extends tracking guarantees for time-varying variational inequalities.
New algorithm tracks subspaces with missing and corrupted data, simpler and federated.
In this paper, we propose new conditions guaranteeing that the trajectories of a mechanical control system can track any curve on the configuration manifold. We focus on systems that can be represented as forced affine connection control systems and we generalize the sufficient conditions for tracking known in the lite…
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…
RL approach for target tracking with unknown dynamics and sensor control.
Perfect tracking control for real-world Euler-Lagrange systems is challenging due to uncertainties in the system model and external disturbances. The magnitude of the tracking error can be reduced either by increasing the feedback gains or improving the model of the system. The latter is clearly preferable as it allows…
Paper presents neural network controllers for offset-free setpoint tracking.
This paper proposes a DGP approach with UCBs for point target tracking over WSNs.
SOOTT framework optimizes target tracking with robust and learning-augmented algorithms.
We study the problem of subspace tracking in the presence of missing data (ST-miss). In recent work, we studied a related problem called robust ST. In this work, we show that a simple modification of our robust ST solution also provably solves ST-miss and robust ST-miss. To our knowledge, our result is the first `compl…
Gaussian Processes (GPs) are widely employed in control and learning because of their principled treatment of uncertainty. However, tracking uncertainty for iterative, multi-step predictions in general leads to an analytically intractable problem. While approximation methods exist, they do not come with guarantees, mak…
Fast robust subspace tracking in sparse data-dependent noise with near-optimal delay.
Gradient filters track moving parameters under noisy data and misspecification.
The paper analyzes Adam and SGD in nonstationary optimization, revealing tradeoffs between noise and drift.
Dynamic robust PCA refers to the dynamic (time-varying) extension of robust PCA (RPCA). It assumes that the true (uncorrupted) data lies in a low-dimensional subspace that can change with time, albeit slowly. The goal is to track this changing subspace over time in the presence of sparse outliers. We develop and study …
New algorithm tackles optimization with distributed constraints.
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 …
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…
New algorithm tracks changes in infinite action space rewards.
For many modern applications in science and engineering, data are collected in a streaming fashion carrying time-varying information, and practitioners need to process them with a limited amount of memory and computational resources in a timely manner for decision making. This often is coupled with the missing data pro…
Transformers learn chain-of-thought reasoning for longer problems, proving length generalization.
Decentralized methods to solve finite-sum minimization problems are important in many signal processing and machine learning tasks where the data is distributed over a network of nodes and raw data sharing is not permitted due to privacy and/or resource constraints. In this article, we review decentralized stochastic f…
Federated learning has emerged as an umbrella term for centralized coordination strategies in multi-agent environments. While many federated learning architectures process data in an online manner, and are hence adaptive by nature, most performance analyses assume static optimization problems and offer no guarantees in…
The paper provides guarantees for feedback control with sensor errors.
Paper presents adaptive minimax risk classifiers for multidimensional concept drift.
Online learning algorithms require to often recompute least squares regression estimates of parameters. We study improving the computational complexity of such algorithms by using stochastic gradient descent (SGD) type schemes in place of classic regression solvers. We show that SGD schemes efficiently track the true s…
We propose an algorithm combining calibrated prediction and generalization bounds from learning theory to construct confidence sets for deep neural networks with PAC guarantees---i.e., the confidence set for a given input contains the true label with high probability. We demonstrate how our approach can be used to cons…
Algorithm identifies best policy in MDPs with adaptive sampling.
This work uses SVM to identify track component failures in AC Track Circuits.
Principal Components Analysis (PCA) is one of the most widely used dimension reduction techniques. Robust PCA (RPCA) refers to the problem of PCA when the data may be corrupted by outliers. Recent work by Cand{è}s, Wright, Li, and Ma defined RPCA as a problem of decomposing a given data matrix into the sum of a low-ran…
Paper proposes ClipSMT algorithm for better ATE estimation.
New train tracks for complex homeomorphisms found.
New method uses cluster shapes to improve track finding in particle collisions.
Unified framework for subsampling mechanisms with tighter privacy guarantees.
Capacity-Constrained Online Convex Optimization with Delayed Feedback
New algorithm infers trajectories from partial observations using optimal transport.
This paper optimizes object tracking on edge devices with small matrices.
Optimal best-arm identification with known number of optimal arms.
A DRL-based strategy improves vehicle tracking accuracy while saving energy.
Paper introduces TAP-Vid, a benchmark for tracking any point in videos.
In this paper, we define the rectangle condition on the bridge sphere for a -bridge decomposition of a knot whose definition is analogous to the definition of the rectangle condition for Heegaard splittings of -manifolds. We show that the satisfaction of the rectangle condition for a -bridge decomposition can …
The efficiency of a modern economy depends on what we call the Value-Tracking Hypothesis: that market prices of key assets broadly track some underlying value. This can be expected if a sufficient weight of market participants are valuation-based traders, buying and selling an asset when its price is, respectively, bel…
We show that the subsurface projection of a train track splitting sequence is an unparameterized quasi-geodesic in the curve complex of the subsurface. For the proof we introduce induced tracks, efficient position, and wide curves. This result is an important step in the proof that the disk complex is Gromov hyperbolic…
Train track automata for fully irreducible elements in Out(F_r).
Dynamic tracking error framework shows similar performance but varying volatility across different constraints.
Paper improves Lasso for S&P500 index tracking with post-selection inference.
A new decentralized algorithm DESTINY solves optimization over Stiefel manifold with single communication round.