This paper uses Factored Latent Analysis (FLA) to learn a factorized, segmental representation for observations of tracked objects over time. Factored Latent Analysis is latent class analysis in which the observation space is subdivided and each aspect of the original space is represented by a separate latent class mod…
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,742 papers · 148 categories
Trend · papers per month
48 results for “Latent Track”
We address tracking and prediction of multiple moving objects in visual data streams as inference and sampling in a disentangled latent state-space model. By encoding objects separately and including explicit position information in the latent state space, we perform tracking via amortized variational Bayesian inferenc…
The study examines the stretch factors of outer automorphisms and their latent symmetry.
problem Understanding stretch factors of outer automorphisms in free groups.
method Analyzes the latent symmetry of graphs and uses it to bound stretch factors.
result A precise notion of latent symmetry provides a lower bound on the number of folds required.
EviTrack improves sequential prediction in delayed disambiguation scenarios.
problem Challenges in sequential prediction with delayed disambiguation where early observations are ambiguous.
method EviTrack operates over latent trajectories, applying evidence- and likelihood-ratio-based selection to delay commitment until supported by data.
result EviTrack outperforms sampling-based baselines in a controlled synthetic benchmark, achieving faster post-disambiguation recovery.
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.
LASER compresses recursive model activations by exploiting their low-dimensional structure.
problem Understanding and optimizing the geometric structure of recursive reasoning trajectories.
method Dynamic low-rank basis tracking via matrix-free subspace tracking with a fidelity-triggered reset mechanism.
result Recursive activations occupy a linear, low-dimensional subspace that can be compressed efficiently.
In this paper we address the problem of tracking multiple speakers via the fusion of visual and auditory information. We propose to exploit the complementary nature of these two modalities in order to accurately estimate smooth trajectories of the tracked persons, to deal with the partial or total absence of one of the…
Object tracking is an ubiquitous problem that appears in many applications such as remote sensing, audio processing, computer vision, human-machine interfaces, human-robot interaction, etc. Although thoroughly investigated in computer vision, tracking a time-varying number of persons remains a challenging open problem.…
PLS-Lasso integrates dimension reduction into regression for financial index tracking.
problem Dimension reduction and regression are traditionally treated separately in multivariate data analysis.
method PLS-Lasso integrates dimension reduction directly into the regression process, presenting two formulations: PLS-Lasso-v1 and PLS-Lasso-v2.
result PLS-Lasso-v1 and PLS-Lasso-v2 outperform Lasso in financial index tracking.
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.
Online learning with streaming data in a distributed and collaborative manner can be useful in a wide range of applications. This topic has been receiving considerable attention in recent years with emphasis on both single-task and multitask scenarios. In single-task adaptation, agents cooperate to track an objective o…
Online DEM improves tracking of latent states in dynamic systems.
problem Tracking latent states in dynamic systems with online updates.
method Specializes DEM for online data assimilation, separating temporal scales.
result ODEM can track latent states of a non-linear generative model.
LatentTrack generates model parameters online for nonstationary data.
problem Online probabilistic prediction under nonstationary dynamics.
method Sequential neural architecture with latent filtering and amortized inference.
result Consistently lower negative log-likelihood and mean squared error than baselines.
Smart phone apps that enable users to easily track their diets have become widespread in the last decade. This has created an opportunity to discover new insights into obesity and weight loss by analyzing the eating habits of the users of such apps. In this paper, we present diet2vec: an approach to modeling latent str…
Latent factor models have achieved great success in personalized recommendations, but they are also notoriously difficult to explain. In this work, we integrate regression trees to guide the learning of latent factor models for recommendation, and use the learnt tree structure to explain the resulting latent factors. S…
This paper proposes a nonparametric Bayesian method for exploratory data analysis and feature construction in continuous time series. Our method focuses on understanding shared features in a set of time series that exhibit significant individual variability. Our method builds on the framework of latent Diricihlet alloc…
Adaptive ML learns complex time-varying systems without new data.
problem Applying ML to time-varying systems with shifting distributions.
method Mapping high-dimensional inputs to low-dimensional latent space, actively tuning latent space based on feedback.
result Learning correlations and tracking system evolution in real-time without new data.
NSFs learn SDE transition laws for efficient sampling.
problem Efficiently sampling between arbitrary time points in SDEs.
method Conditional normalising flows with architectural constraints.
result Up to two orders of magnitude speed-ups at large time gaps.
Proposes a model to handle mobile health data with irregular measurements.
problem Handling heterogeneous, multi-resolution data in mobile health.
method Individualized dynamic latent factor model for irregular multi-resolution time series data.
result Superior performance compared to existing methods in simulation and smartwatch data applications.
Adversarial autoencoder improves music latent space learning.
problem Learning effective latent spaces for symbolic music data.
method Adversarial regularization with Gaussian mixtures.
result MusAE outperforms standard VAEs in reconstruction and interpolation.
Improved VAEs learn flat latent spaces for better data similarity.
problem Measuring data similarity in latent spaces using Euclidean metric.
method Extend VAEs to learn flat latent manifolds using Riemannian geometry and regularisation.
result Improved performance on video-tracking benchmarks, nears supervised methods.
LD-EnSF speeds up data assimilation with sparse observations.
problem Efficiently assimilate sparse and noisy data into complex dynamical systems.
method LD-EnSF uses latent dynamics networks and history-aware LSTM encoders to process sparse observations without full-space simulations.
result Achieves significant speedups over existing methods while maintaining high accuracy.
AMES framework selects optimal embedding space for latent graph inference.
problem No principled method for choosing the best embedding space for latent graph inference.
method Differentiable AMES framework using backpropagation to select optimal embedding space.
result Consistently achieves comparable or superior results across multiple datasets.
Paper presents a method to efficiently learn ordered representations of multi-agent data.
problem Challenges in learning consistent representations of multi-agent interactions.
method Dynamic alignment method to order multi-agent data for faster representation learning.
result Representation learning of multi-agent data is significantly accelerated.
We present Sequential Attend, Infer, Repeat (SQAIR), an interpretable deep generative model for videos of moving objects. It can reliably discover and track objects throughout the sequence of frames, and can also generate future frames conditioning on the current frame, thereby simulating expected motion of objects. Th…
How can we efficiently propagate uncertainty in a latent state representation with recurrent neural networks? This paper introduces stochastic recurrent neural networks which glue a deterministic recurrent neural network and a state space model together to form a stochastic and sequential neural generative model. The c…
End-to-end autonomous driving perception learns latent features for better performance.
problem Current autonomous driving systems are complex and require human engineering.
method Sequential latent representation learning for end-to-end perception.
result End-to-end perception model solves detection, tracking, localization, and mapping problems.
Dynamic Word Embeddingsstat.ML
We present a probabilistic language model for time-stamped text data which tracks the semantic evolution of individual words over time. The model represents words and contexts by latent trajectories in an embedding space. At each moment in time, the embedding vectors are inferred from a probabilistic version of word2ve…
We address a portfolio selection problem that combines active (outperformance) and passive (tracking) objectives using techniques from convex analysis. We assume a general semimartingale market model where the assets' growth rate processes are driven by a latent factor. Using techniques from convex analysis we obtain a…
New technologies for recording the activity of large neural populations during complex behavior provide exciting opportunities for investigating the neural computations that underlie perception, cognition, and decision-making. Nonlinear state space models provide an interpretable signal processing framework by combinin…
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.
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.
Online distributional prediction with latent cluster geometry
problem Predicting the full data-generating distribution in non-stationary streams
method Representing candidate laws as latent cluster geometry and using Gibbs quasi-posterior
result Achieving sublinear cumulative Wasserstein regret under bounded support and stable latent geometry
New train tracks for complex homeomorphisms found.
problem Existence of irreducible train tracks for pseudo-Anosov homeomorphisms.
method Starting from a veering triangulation, identify and modify branches to bypass obstructions.
result Construction of invariant train tracks with irreducible transition matrix.
Improved genetic programming by optimizing mutation operators for continuous program search.
problem Small syntactic mutations in genetic programming can lead to unpredictable behavioral shifts.
method Learned a compact trading-strategy DSL, created a block-factorized embedding, and designed geometry-compiled mutation operators.
result Geometry-compiled mutation operators discover strong strategies using fewer evaluations and achieve higher Sharpe ratios.
Beyond 4D Tracking: Using Cluster Shapes for Track Seedingphysics.ins-det
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.
A new framework for structured bandits using influence diagrams and variational Thompson sampling.
problem Complex statistical dependencies in structured bandit problems.
method Influence diagram framework, variational Thompson sampling, tracking structured posterior distribution.
result Empirically evaluated algorithms perform as well as or better than existing baselines.
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.
A DRL-based strategy improves vehicle tracking accuracy while saving energy.
problem Enhancing vehicle tracking accuracy in WSNs without increasing energy consumption.
method Decentralized strategy with dynamic reinforcement learning to adjust sensing areas.
result Simulation results demonstrate superior performance of DRL-aided design.
We present two online causal structure learning algorithms which can track changes in a causal structure and process data in a dynamic real-time manner. Standard causal structure learning algorithms assume that causal structure does not change during the data collection process, but in real-world scenarios, it does oft…
VANO uses neural operators for unsupervised learning of functional data.
problem Learning operators between infinite dimensional spaces for functional data.
method Variational Autoencoding Neural Operators (VANO) approach.
result VANO can learn and reconstruct functional data without supervision.
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.
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).
problem Understanding fully irreducible elements in Out(F_r).
method Describing train track automata and geodesics in Outer Space.
result Geodesics in Culler-Vogtmann Outer Space for fully irreducible elements.
Dynamic tracking error framework shows similar performance but varying volatility across different constraints.
problem Differences in governance parameters between Total Portfolio Approach and Strategic Asset Allocation.
method Portfolio simulations using U.S. equity and bond data from 2000 to 2026, spanning 2004 to 2026.
result Realized tracking error volatility varies 12-fold across different constraints, with costs highest during crises.
A new neural network approach reduces tracking error in index replication.
problem Efficiently replicating an index with cardinality constraints.
method Reparametrisation and stochastic neural networks for optimisation.
result Our model achieves the lowest tracking error compared to benchmarks.
In a dynamic network, the neighborhood of the vertices evolve across different temporal snapshots of the network. Accurate modeling of this temporal evolution can help solve complex tasks involving real-life social and interaction networks. However, existing models for learning latent representation are inadequate for …