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…
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “collision penalties”
Training neural networks under physical constraints using a stochastic augmented Lagrangian approachphysics.comp-ph
Stochastic approach improves neural network training for kinetic simulations.
problem Training neural networks under physical constraints in kinetic fusion simulations.
method Stochastic augmented Lagrangian approach using pyTorch.
result Higher model prediction accuracy achieved compared to fixed penalty method.
New algorithm reduces regret in multi-player bandits with collision information.
problem Optimizing decisions in multi-player bandits with collision penalties.
method Developed an algorithm with optimal regret under collision announcements, and sublinear regret without collision info.
result First -type regret guarantee for non-stochastic multi-player multi-armed bandits with collision information.
Residual neural networks improve collision prediction in planetary simulations.
problem Accurate prediction of planetary collisions in N-body simulations.
method Residual neural networks trained on collision data.
result Residual neural networks outperform existing methods in prediction accuracy and generalization.
Study nonholonomic systems with collisions using variational principles.
problem Variational problems on nonholonomic systems with collisions.
method Extended variational principle, introduced connection on principal bundles, applied Lagrange–Poincaré–Pontryagin reduction.
result Implicit Lagrange–d'Alembert–Pontryagin equations for nonholonomic systems with collisions.
Paper analyzes dynamics of nonholonomic systems with collisions using variational techniques.
problem Analyzing the dynamics of nonholonomic mechanical systems with impacts.
method Variational techniques extended to nonsmooth context for collisions.
result Variational formulation for implicit nonholonomic mechanical systems with energy-momentum preserving collisions.
Model forecasts motor vehicle collision rates with high accuracy.
problem Forecasting motor vehicle collision rates with high accuracy.
method Adopted Heston Stochastic Volatility model and extended it to account for seasonality and accelerated safety periods.
result Short-term forecasts show high accuracy (over 95%) and outperform existing models.
Machine learning competition predicts spacecraft collision risks.
problem Predicting future collision risks between orbiting satellites.
method Machine learning models trained on satellite collision data.
result Models accurately predicted collision risks with high precision.
Near-optimal algorithms for private estimation and sequential testing of collision probabilitystat.ML
New algorithms estimate and test collision probability with near-optimal sample complexity.
problem Estimating and testing collision probability in discrete distributions.
method Developed algorithms for -local differential privacy and sequential testing.
result Achieved nearly optimal sample complexity for estimating and testing collision probability.
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…
No-collision maps improve manifold learning for image data.
problem Lack of geometric feature sensitivity in traditional distance measures.
method Developed no-collision transportation maps and distances.
result No-collision distances provide isometry for translations and dilations.
A new metric for uncertainty quantification using class collisions.
problem Fine-grained uncertainty quantification in classification problems.
method Introducing the collision matrix and estimating it from one-hot labeled data.
result The collision matrix uniquely recovers the posterior class probability distribution.
Reduces necessary conditions for collision avoidance on curved spaces.
problem Finding non-intersecting trajectories for multiple agents on curved spaces.
method Reduction by Lie group symmetries of variational collision avoidance problems.
result Derives necessary conditions for reduced extremals.
New algorithm for multi-player bandits with collision-dependent rewards.
problem Stochastic multi-player multi-armed bandits with collision-dependent reward distributions.
method Error-Correction Collision Communication (EC3) algorithm.
result EC3 algorithm achieves optimal regret approaching centralized MP-MAB regret.
Algorithm reduces regret in multi-player bandits with unknown collision rewards.
problem Reducing regret in multi-player multi-armed bandits with unknown collision rewards.
method Proposes an algorithm that combines a modified successive elimination strategy with a communication protocol to estimate suboptimality gaps and coordinate among players.
result Achieves logarithmic regret for the problem when collision reward is unknown.
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.
problem Decentralized multi-player multi-armed bandits with no collision info.
method EC-SIC algorithm using optimal error correction coding for reward statistics.
result Regret approaches that of centralized with collision info.
A new algorithm RESYNC for defenders against malicious attackers in multi-player bandits.
problem Malicious players colliding with cooperative players to prevent rewards.
method Decentralized and robust algorithm RESYNC for defenders.
result RESYNC algorithm is order-optimal, performing gracefully as the number of collisions increases.
Examining orbits ending in binary collisions for three equal masses under an inverse cube force.
problem Analyzing orbits ending in binary collisions for three equal masses under an inverse cube force.
method Reparametrizing orbits as geodesics on a negatively curved metric on a pair of pants.
result Visibility properties of negatively curved surfaces describe orbits beginning or ending in binary collisions.
A new algorithm reduces regret in multiplayer bandits with minimal communication.
problem Maximizing rewards in multiplayer multi-armed bandits with collisions.
method DPE (Decentralized Parsimonious Exploration) algorithm.
result Achieves the same regret as optimal centralized algorithms with less communication.
Bayesian deep learning predicts satellite collisions.
problem Space debris poses planetary risk.
method Bayesian deep learning with LSTM networks.
result Predicts conjunction event evolution with uncertainties.
New algorithms tackle adversarial multi-player bandits with forced-collision communication.
problem No-sensing adversarial multi-player multi-armed bandits (MP-MAB) problem.
method Adversary-Adaptive Collision-Communication (A2C2) algorithms, attackability-aware and unaware settings, information-theoretic tools, error-correction coding.
result Asymptotic attackability-dependent sublinear regret achieved, with or without knowing attackability.
New strategy achieves optimal regret without communication or collisions in multi-player bandit.
problem Cooperative multi-player stochastic multi-armed bandit with shared randomness.
method Combination of combinatorial approach to generalize geometric intuition.
result Achieves near-optimal regret for any number of players and arms without collisions.
Novel method decomposes configuration space for improved collision checking.
problem Improving collision checking in high-degree-of-freedom robot motion planning.
method Proposes a configuration space decomposition method to build a composite classifier.
result Composite classifier outperforms state-of-the-art single classifier methods.
Study shows how transformers classify symbols without naming them, proving a margin-versus-collision criterion.
problem How transformers classify symbols without naming them.
method Logistic classification analysis of transformer-kernel regime, colored collision graph.
result Decomposes learned predictor into ideal template-level classifier and finite-sample perturbation.
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…
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…
Study motion planning for points avoiding obstacles in a plane.
problem Avoiding collisions for multiple points in a plane with unknown obstacles.
method Algebraic and topological tools for motion planning.
result New topological complexity for planar motion planning.
Classifiers for centrality determination in proton-nucleus and nucleus-nucleus collisionsphysics.data-an
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.
problem Recovering the geometry of a Riemannian manifold from geodesic intersection lengths.
method Applying stitching data to solve the delayed collision data problem.
result Geometry of the manifold can be recovered from geodesic intersection lengths.
Generative model for set-valued data using permutation invariant flows.
problem Modeling set-valued data with conditional generative models.
method Conditional generative probabilistic model using continuous normalizing flows with permutation equivariant dynamics.
result Significantly outperforms non-permutation invariant baselines in log likelihood and domain-specific metrics.
Zero-energy orbits in the Kepler-Heisenberg problem are self-similar and stratify into three families.
problem Determining the motion of a planet around a sun in the Heisenberg group.
method Analysis of the sub-Riemannian Hamiltonian and sub-Laplacian dynamics.
result Zero-energy orbits are self-similar and stratify into future collision, past collision, and quasi-periodic families.
New algorithm for multi-player bandits without needing lower bounds or scaling inversely.
problem Multi-player bandits without collision sensing information.
method Proposes a novel algorithm that circumvents two problems of existing algorithms.
result Proves a theoretical regret upper bound and shows superior performance in practice.
SafeCritic predicts safe trajectories for pedestrians and cyclists avoiding collisions.
problem Predicting safe trajectories for pedestrians and cyclists in urban environments.
method Generative adversarial networks and reinforcement learning to generate safe trajectories, evaluated by a Discriminator.
result Significant improvement over state-of-the-art models in safety classification.
Decentralized Heterogeneous Multi-Player Multi-Armed Bandits with Non-Zero Rewards on Collisionscs.LG
A policy for near-optimal multi-player bandits with non-zero collision rewards.
problem Decentralized multi-player bandits with heterogeneous rewards and collisions.
method A policy achieving near-optimal regret in a non-communicative setting.
result Near order-optimal expected regret of for .
Unified approach detects traffic conflicts across various interactions.
problem Inconsistent detection of traffic conflicts across different interactions.
method Unified probabilistic approach decomposes conflicts into statistical learning tasks.
result Effective collision warnings across diverse datasets and environments.
Rolling systems limit to billiard models with no-slip collisions.
problem Understanding how rolling systems behave as billiard models with no-slip collisions.
method Showed that no-slip billiards arise as limits of non-holonomic rolling systems.
result Rolling systems limit to billiard models with no-slip collisions.
IC-Network improves CNNs by integrating elastic collision units.
problem Designing more effective basic units in neural networks.
method Developed IC layer and IC block units combining the IC structure with convolution operations.
result Significant performance improvements in existing CNNs, reducing top-1 error from 22.85% to 21.49% on imagenet.
Multipeakons are special solutions to the Camassa-Holm equation described by an integrable geodesic flow on a Riemannian manifold. We present a bi-Hamiltonian formulation of the system explicitly and write down formulae for the associated first integrals. Then we exploit the first integrals and present a novel approach…
Generalizes Landau-Ginzburg mirrors for Frobenius manifolds in Dynkin type A.
problem Classifying Frobenius manifold structures in Dynkin type A.
method Generalizing the method from previous works, developing a pole-collision framework.
result Structural result at the level of prepotential for arbitrary rank and dimension.
This work improves motion planning for quadcopters by learning and reasoning about controller performance.
problem Improving motion planning for quadcopters with safety margins and execution reliability.
method Introspective learning and reasoning to correct execution bias and improve collision checking.
result Substantial reduction in safety margins for motion actions, leading to safer execution.
Massive Autonomous UAV Path Planning: A Neural Network Based Mean-Field Game Theoretic Approacheess.SY
This paper tackles collision avoidance for many UAVs using MFG and ML.
problem Collision avoidance for many UAVs in real-time missions.
method Mean-field game (MFG) theory combined with machine learning (ML) to reduce computation and communication energy.
result The proposed MFG learning control method achieves collision avoidance with low communication and acceptable computation energy.
This work optimizes signal estimation for sparse MRA with collision-free signals.
problem Recovering an unknown signal from repeated observations under cyclic isometries with high noise.
method Investigates minimax optimality for collision-free signals in the MRA model.
result The minimax optimal rate of estimation is \( \sigma^2/\sqrt{n} \) for sparse MRA.
CriticSMC improves planning efficiency in constrained environments.
problem Planning with hard constraints in dynamic environments.
method Sequential Monte Carlo with learned heuristic factors.
result CriticSMC reduces collision rates with low computational cost.
CARML uses meta-learning to avoid obstacles in 2D vehicle navigation.
problem Collision avoidance in 2D vehicle navigation.
method Model-Agnostic Meta-Learning for multi-objective reinforcement learning.
result CARML outperforms a baseline TD3 solution in obstacle avoidance.
A fast method learns plasma collision kernels from simulations, improving kinetic models.
problem Improving kinetic models for plasma dynamics beyond the weakly coupled regime.
method Data-driven collisional operator, fast spectral separation method.
result Accurately captures plasma dynamics in moderately coupled regime.
Develops scalable differentiable physics for complex object interactions.
problem Limited scalability of existing differentiable physics solvers.
method Adopting meshes for arbitrary geometry, localized collision handling, and accelerated implicit differentiation.
result Significantly reduces memory and computation requirements compared to particle-based methods.
Hybrid RL combines simulated and real data for robust autonomous flight.
problem Challenges in training deep RL models for real-world robotic tasks.
method Combines real-world and simulated data to improve generalization.
result Quadrotor avoids collisions using only a monocular camera.