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,742 papers · 148 categories

Trend · papers per month

3.1%6.3%9.4%12.5% · Aug 199619922001200920172026
48 results for Elastic collision

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.

This paper considers ideal gas-like models of trading markets, where each agent is identified as a gas molecule that interacts with others trading in elastic or money-conservative collisions. Traditionally, these models introduce different rules of random selection and exchange between pair agents. Unlike these traditi…

2009-04-02abs ↗pdf ↗

We consider the ideal-gas models of trading markets, where each agent is identified with a gas molecule and each trading as an elastic or money-conserving (two-body) collision. Unlike in the ideal gas, we introduce saving propensity λλ of agents, such that each agent saves a fraction λλ of its money and trades with t…

2003-11-11abs ↗pdf ↗

We consider the ideal-gas models of trading markets, where each agent is identified with a gas molecule and each trading as an elastic or money-conserving (two-body) collision. Unlike in the ideal gas, we introduce saving propensity λλ of agents, such that each agent saves a fraction λλ of its money and trades with t…

2003-02-07abs ↗pdf ↗

This paper considers the ideal gas-like model of trading markets, where each individual is identified as a gas molecule that interacts with others trading in elastic or money-conservative collisions. Traditionally this model introduces different rules of random selection and exchange between pair agents. Real economic …

2009-06-10abs ↗pdf ↗

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.

We have numerically simulated the ideal-gas models of trading markets, where each agent is identified with a gas molecule and each trading as an elastic or money-conserving two-body collision. Unlike in the ideal gas, we introduce (quenched) saving propensity of the agents, distributed widely between the agents ($0 \le…

2003-01-16abs ↗pdf ↗

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.

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.

The paper addresses the Multiplayer Multi-Armed Bandit (MMAB) problem, where MM 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…

2019-09-28abs ↗pdf ↗

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…

2017-08-16abs ↗pdf ↗

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 ildeO(T) ilde{O}(\sqrt{T}) 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…

2018-08-25abs ↗pdf ↗

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.

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…

2019-01-03abs ↗pdf ↗

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…

2019-08-28abs ↗pdf ↗

The paper studies rigidity and continuity in nonlinear elasticity on manifolds and hypersurfaces.

problem Rigidity and continuity properties of elastic bodies in non-Euclidean settings.
method Geometric rigidity estimates, asymptotic rigidity of elastic membranes, simplified geometric proof of continuous dependence.
result Established geometric rigidity estimate and proved asymptotic rigidity of elastic membranes.

Study preserves planar and graphical properties of curves under elastic flow.

problem Maintaining planar and graphical properties of non-compact curves under elastic flow.
method Extended recent work on adapted elastic energy to derive thresholds for planar and graphical embeddedness.
result Derived new Li--Yau type inequality for complete planar curves.

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.

The paper studies the free elastic flow of closed curves and finds their asymptotic shape converges to a circle.

problem Challenges in studying the asymptotic behavior of the free elastic flow for closed curves.
method Analysis of the free elastic flow as an L2L^2-gradient flow for Euler's elastic energy.
result An appropriate rescaling of initial curves geometrically close to circles converges to a unique round circle.