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.
Paper analyzes dynamics of nonholonomic systems with collisions using variational techniques.
One approach to designing decision making logic for an aircraft collision avoidance system frames the problem as a Markov decision process and optimizes the system using dynamic programming. The resulting collision avoidance strategy can be represented as a numeric table. This methodology has been used in the developme…
The Kepler-Heisenberg problem is that of determining the motion of a planet around a sun in the Heisenberg group, thought of as a three-dimensional sub-Riemannian manifold. The sub-Riemannian Hamiltonian provides the kinetic energy, and the gravitational potential is given by the fundamental solution to the sub-Laplaci…
A fast method learns plasma collision kernels from simulations, improving kinetic models.
The configuration manifold of a mechanical system consisting of two unconstrained rigid bodies in , , is a manifold with boundary (typically with singularities.) A complete description of the system requires boundary conditions that specify how orbits should be continued after collisions. A b…
Residual neural networks improve collision prediction in planetary simulations.
This work examines the role of reinforcement learning in reducing the severity of on-road collisions by controlling velocity and steering in situations in which contact is imminent. We construct a model, given camera images as input, that is capable of learning and predicting the dynamics of obstacles, cars and pedestr…
Study nonholonomic systems with collisions using variational principles.
Model forecasts motor vehicle collision rates with high accuracy.
Machine learning competition predicts spacecraft collision risks.
We discuss the equivalence between kinetic wealth-exchange models, in which agents exchange wealth during trades, and mechanical models of particles, exchanging energy during collisions. The universality of the underlying dynamics is shown both through a variational approach based on the minimization of the Boltzmann e…
New algorithms estimate and test collision probability with near-optimal sample complexity.
Paper applies fluid dynamics to stock market behavior.
No-collision maps improve manifold learning for image data.
Reduces necessary conditions for collision avoidance on curved spaces.
A new metric for uncertainty quantification using class collisions.
New algorithm for multi-player bandits with collision-dependent rewards.
This work improves motion planning for quadcopters by learning and reasoning about controller performance.
The paper addresses the Multiplayer Multi-Armed Bandit (MMAB) problem, where decision makers or players collaborate to maximize their cumulative reward. When several players select the same arm, a collision occurs and no reward is collected on this arm. Players involved in a collision are informed about this collis…
Algorithm reduces regret in multi-player bandits with unknown collision rewards.
Motivated by cognitive radio networks, we consider the stochastic multiplayer multi-armed bandit problem, where several players pull arms simultaneously and collisions occur if one of them is pulled by several players at the same stage. We present a decentralized algorithm that achieves the same performance as a centra…
An important application of intelligent vehicles is advance detection of dangerous events such as collisions. This problem is framed as a problem of optimal alarm choice given predictive models for vehicle location and motion. Techniques for real-time collision detection are surveyed and grouped into three classes: ran…
A new algorithm reduces regret in multi-player bandits without collision info.
A new algorithm RESYNC for defenders against malicious attackers in multi-player bandits.
Bayesian deep learning predicts satellite collisions.
New algorithms tackle adversarial multi-player bandits with forced-collision communication.
New strategy achieves optimal regret without communication or collisions in multi-player bandit.
We show that any bounded zero-angular momentum solution for the Newtonian three-body problem must suffer infinitely many eclipses, or collinearities, provided that it does not suffer a triple collision. Motivation for the result comes from the dream of building a symbolic dynamics for the three-body problem, one whose …
Logit dynamics formula reveals self-regulation in softmax policy gradient methods.
Study shows how transformers classify symbols without naming them, proving a margin-versus-collision criterion.
System identification of complex and nonlinear systems is a central problem for model predictive control and model-based reinforcement learning. Despite their complexity, such systems can often be approximated well by a set of linear dynamical systems if broken into appropriate subsequences. This mechanism not only hel…
We study multiplayer stochastic multi-armed bandit problems in which the players cannot communicate and if two or more players pull the same arm, a collision occurs and the involved players receive zero reward. We consider two feedback models: a model in which the players can observe whether a collision has occurred an…
Navigating complex urban environments safely is a key to realize fully autonomous systems. Predicting future locations of vulnerable road users, such as pedestrians and cyclists, thus, has received a lot of attention in the recent years. While previous works have addressed modeling interactions with the static (obstacl…
Study motion planning for points avoiding obstacles in a plane.
Geometric tools study two- and threepeakons in Camassa-Holm equation.
Deep reinforcement learning provides a promising approach for vision-based control of real-world robots. However, the generalization of such models depends critically on the quantity and variety of data available for training. This data can be difficult to obtain for some types of robotic systems, such as fragile, smal…
Centrality, as a geometrical property of the collision, is crucial for the physical interpretation of nucleus-nucleus and proton-nucleus experimental data. However, it cannot be directly accessed in event-by-event data analysis. Common methods for centrality estimation in A-A and p-A collisions usually rely on a single…
Recovering manifold geometry from geodesic intersections.
We consider the non-stochastic version of the (cooperative) multi-player multi-armed bandit problem. The model assumes no communication at all between the players, and furthermore when two (or more) players select the same action this results in a maximal loss. We prove the first -type regret guarantee for th…
New algorithm outperforms existing ones in multi-player bandit problems without sensing.
New algorithm for multi-player bandits without needing lower bounds or scaling inversely.
A multi-user multi-armed bandit (MAB) framework is used to develop algorithms for uncoordinated spectrum access. The number of users is assumed to be unknown to each user. A stochastic setting is first considered, where the rewards on a channel are the same for each user. In contrast to prior work, it is assumed that t…
We introduce a method for learning the dynamics of complex nonlinear systems based on deep generative models over temporal segments of states and actions. Unlike dynamics models that operate over individual discrete timesteps, we learn the distribution over future state trajectories conditioned on past state, past acti…
Unified approach detects traffic conflicts across various interactions.
A step by step procedure to derive analytically the exact dynamical evolution equations of the probability density functions (PDF) of well known kinetic wealth exchange economic models is shown. This technique gives a dynamical insight into the evolution of the PDF, e.g., allowing the calculation of its relaxation time…
Rolling systems limit to billiard models with no-slip collisions.
Motion planning for robots of high degrees-of-freedom (DOFs) is an important problem in robotics with sampling-based methods in configuration space C as one popular solution. Recently, machine learning methods have been introduced into sampling-based motion planning methods, which train a classifier to distinguish coll…
Up to symmetries, the orbits of three equal masses under an inverse cube force with zero angular momentum and constant moment of inertia can be reparametrized as the geodesics of a complete, negatively curved metric on a pair of pants. The ends of the pants represent binary collisions. Here we will examine the visibili…