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

12243547 · May 202619922001200920172026
48 results for multi-object tracking

PiVoT improves real-time multi-object detection and tracking in clutter.

problem Challenges in multi-object detection and tracking from noisy point clouds.
method Variational inference for fast, clutter-resilient multi-object tracking.
result Substantial performance improvement over existing Bayesian trackers.

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.

Tracking large numbers of densely-arranged, interacting objects is challenging due to occlusions and the resulting complexity of possible trajectory combinations, as well as the sparsity of relevant, labeled datasets. Here we describe a novel technique of collective tracking in the model environment of a 2D honeybee hi…

2018-12-31abs ↗pdf ↗

The problem of Multiple Object Tracking (MOT) consists in following the trajectory of different objects in a sequence, usually a video. In recent years, with the rise of Deep Learning, the algorithms that provide a solution to this problem have benefited from the representational power of deep models. This paper provid…

2019-07-18abs ↗pdf ↗

Modern computer vision algorithms typically require expensive data acquisition and accurate manual labeling. In this work, we instead leverage the recent progress in computer graphics to generate fully labeled, dynamic, and photo-realistic proxy virtual worlds. We propose an efficient real-to-virtual world cloning meth…

2016-05-20abs ↗pdf ↗

FraPPE efficiently identifies Pareto optimal arms in multi-objective bandits.

problem Efficiently identifying Pareto optimal arms in multi-objective bandits with confidence.
method Deriving structural properties and using Frank-Wolfe optimisation to solve the maxmin optimisation problem.
result FraPPE achieves optimal sample complexity and identifies the exact Pareto set.

New security patch for object tracking in self-driving cars mitigates vulnerabilities.

problem Vulnerability of object tracking in self-driving cars, especially Kalman Filter-based trackers.
method Adaptive strategy to balance focus on observations and predictions based on deviation anomaly index.
result Certified effectiveness against a generalized hijacking attack model.

A new Adamize method improves multi-objective recommender systems.

problem Improving recommendation systems with multiple conflicting objectives.
method Developed a multi-objective model-agnostic Adamize method that corrects and stabilizes gradients.
result Significant improvements in recommendation systems, measured by hypervolume, coverage, and spacing.

Proof of convergence for multi-objective optimization using inverse reinforcement learning.

problem Proving convergence in multi-objective optimization problems.
method Wasserstein inverse reinforcement learning with projective subgradient method and gradient descent.
result Convergence of inverse reinforcement learning for multi-objective optimization.

Proof shows imitation of expert's reward and solutions in multi-objective optimization.

problem Multi-objective optimization with reward and solution imitation.
method Wasserstein inverse reinforcement learning.
result Wasserstein inverse reinforcement learning enables imitation of expert's reward and solutions in multi-objective optimization.

Study on Pareto optimality in multi-objective bandit problems.

problem Pareto optimality in multi-objective multi-armed bandit problems.
method Formulated adversarial multi-objective multi-armed bandit, defined Pareto regrets, presented algorithms, established upper and lower bounds.
result New algorithms are optimal in adversarial settings and nearly optimal in stochastic settings.

Achieving fusion of deep learning with combinatorial algorithms promises transformative changes to artificial intelligence. One possible approach is to introduce combinatorial building blocks into neural networks. Such end-to-end architectures have the potential to tackle combinatorial problems on raw input data such a…

2019-12-04abs ↗pdf ↗

Develops a new method to improve performance in multi-objective learning problems.

problem Gradient bias in multi-objective learning leading to degraded performance.
method Stochastic Multi-objective gradient Correction (MoCo) method that guarantees convergence without increasing batch size.
result Demonstrates effectiveness of MoCo method in simulations on multi-task learning.

This paper surveys gradient-based multi-objective deep learning methods.

problem Balancing multiple conflicting objectives in deep learning models.
method Gradient-based techniques adapted from Multi-Objective Optimization.
result Comprehensive survey of gradient-based multi-objective deep learning algorithms.

The paper explores a Multi-Objective RL approach for trading that generalizes reward functions.

problem Improving performance in single-asset trading through adaptive reward functions.
method Developed a Multi-Objective Deep Reinforcement Learning algorithm to generalize reward functions and discount factors.
result The Multi-Objective algorithm demonstrates increased predictive stability and better performance in sparse reward scenarios.

Simple greedy algorithms can excel in multi-objective bandits with multiple good arms.

problem Optimizing multiple objectives in bandits is traditionally harder.
method Introduced greedy algorithms that exploit multiple good arms for multiple objectives.
result Simple greedy algorithms achieve strong performance in multi-objective bandits.

Study KKT conditions for multi-objective optimization on Hadamard manifolds.

problem Optimizing multi-objective interval-valued functions on Hadamard manifolds.
method Developed KKT conditions for Pareto optimal solutions under different ordering and convexity notions.
result Results are more general than on Euclidean spaces.

The paper introduces a new metric to quantify uncertainty's impact on multiple objectives.

problem Quantifying the impact of uncertainty on multiple objectives in complex systems.
method Proposes the mean multi-objective cost of uncertainty (multi-objective MOCU) to quantify uncertainty.
result Demonstrates the effectiveness of the multi-objective MOCU in real-world applications.

New method improves neural architecture search by optimizing for both performance and diversity.

problem Traditional multi-objective NAS fails to address practical constraints and niches.
method Formulated as quality diversity optimization, introduces multifidelity optimizers.
result Quality diversity NAS outperforms multi-objective NAS in quality and efficiency.

This work fills the gap in understanding multi-objective learning generalization.

problem Lack of statistical learning theory insights into multi-objective learning generalization.
method Established generalization bounds and excess bounds for multi-objective learning.
result Showed that all Pareto-optimal solutions can be approximated by empirically Pareto-optimal ones, but not vice versa.

This paper introduces multi-objective hyperparameter optimization in machine learning.

problem Optimizing machine learning pipelines for multiple objectives, not just accuracy.
method Survey of optimization strategies and applications in multi-objective hyperparameter optimization.
result The importance and utility of multi-objective hyperparameter optimization in applied machine learning.

A new method for diverse Pareto solutions in multi-objective learning.

problem Maximizing diversity while maximizing hypervolume in Pareto solutions.
method Annealed Stein Variational Gradient Descent (SVGD) with diverse gradient directions.
result SVH-MOL achieves superior performance in multi-objective and multi-task learning.

This paper develops a method to approximate the whole Pareto set for expensive multi-objective optimization.

problem Finding an approximate Pareto front with limited expensive evaluations.
method A novel learning-based method to approximate the whole Pareto set for multi-objective Bayesian optimization (MOBO).
result The method approximates the whole Pareto set, not just a finite set, for MOBO.

A new method for incorporating preferences in multi-objective Bayesian optimization.

problem Incorporating preferences in computationally expensive multi-objective optimization problems.
method Building independent surrogate models on each objective function and using Generalised value distribution to approximate the scalarizing function.
result The proposed multi-surrogate approach outperforms the mono-surrogate approach on benchmark and real-world problems.

Paper approximates solutions for complex decision processes with limited precision.

problem Approximating the set of all solutions for Multi-objective Markov Decision Processes.
method Limited precision approach based on White's multi-objective value-iteration dynamic programming algorithm.
result The number of calculated solutions is tractable and approximates the true Pareto front.

MOL-TS uses Thompson Sampling for multi-objective linear bandits with Pareto guarantees.

problem Optimizing multiple conflicting objectives in linear contextual bandits.
method Proposes MOL-TS, a Thompson Sampling algorithm with Pareto regret guarantees.
result Achieves a worst-case Pareto regret bound of O~(d3/2T)\widetilde{O}(d^{3/2}\sqrt{T}).

A new parallel BO method with exact gradients for multi-objective optimization.

problem Efficiently optimizing multiple objectives in a sample-efficient manner.
method Derive q-Expected Hypervolume Improvement (qEHVI) for parallel, constrained evaluation.
result qEHVI is computationally tractable and outperforms state-of-the-art methods.

Many real-world applications are characterized by a number of conflicting performance measures. As optimizing in a multi-objective setting leads to a set of non-dominated solutions, a preference function is required for selecting the solution with the appropriate trade-off between the objectives. The question is: how g…

2017-01-04abs ↗pdf ↗

Paper tackles multi-object reinforcement learning, improving skill extrapolation.

problem Learning robust manipulation tasks in multi-object settings.
method Introduces a linear relation network module to enhance skill generalization.
result Agents can extrapolate and generalize to any new object number, scaling linearly.

Deep learning agent improves pedestrian navigation in urban environments.

problem Autonomous driving among pedestrians in urban areas.
method Multi-objective deep reinforcement learning using a deep Q-learning variant.
result The multi-objective DQN agent outperforms single-objective DQN in various environments.

Reducing barriers to entry in large-scale ML markets, study shows multi-objective learning can lower data requirements.

problem Barriers to entry in emerging markets for large-scale machine learning models.
method Defined a multi-objective high-dimensional regression framework to study reputational damage and data requirements.
result The number of data points needed for a new company to enter the market can be significantly smaller than the incumbent company's dataset size.

Wind farm layout optimisation tackles space constraints with Bayesian multi-objective approach.

problem Optimizing wind farm layout due to limited space and conflicting objectives.
method Set-based multi-objective Bayesian optimisation using Gaussian process.
result Demonstrates potential of set-based Bayesian multi-objective optimisation for wind farm layout.