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

2579 · May 201919922001200920172026
48 results for pole collision

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.

Study moduli space of quadratic differentials with new geometric insights.

problem Understanding the structure of moduli spaces of quadratic differentials.
method Using decorated marked surfaces, Abel-Jacobi map, and 3-Calabi-Yau categories.
result Fundamental group of moduli space equals kernel of Abel-Jacobi map.

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.

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.

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 ↗

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…

2019-12-28abs ↗pdf ↗

Finite groups can be automorphism groups of translation surfaces with poles.

problem Existence of finite automorphism groups on translation surfaces with poles.
method Analyzing translation surfaces with poles and extending results to branched projective structures.
result Finite groups can be automorphism groups of translation surfaces with poles.

Flat surfaces that correspond to kk-differentials on compact Riemann surfaces are of finite area provided there is no pole of order kk or higher. We denote by \textit{flat surfaces with poles of higher order} those surfaces with flat structures defined by a kk-differential with at least one pole of order at least $k…

2016-06-12abs ↗pdf ↗

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.

In this note, we classify all solutions to the SU(n)\mathrm{SU(n)} Kapustin-Witten equations on S1×Σ×R+S^1\timesΣ\times \mathbb{R}^+, where ΣΣ is a compact Riemann surface, with Nahm pole singularity at S1×Σ×{0}S^1\timesΣ\times \{0\}. We provide a similar classification of solutions with generalized Nahm pole singularities along a …

2019-01-02abs ↗pdf ↗

For a 3-manifold XX and compact simple Lie group GG, we study the expansions of polyhomogeneous Nahm pole solutions to the Kapustin-Witten equations over X×(0,+)X\times (0,+\infty). Let yy be the coordinate of (0,+)(0,+\infty), we prove that the sub-leading terms of a polyhomogeneous Nahm pole solution is smooth to the boun…

2018-08-12abs ↗pdf ↗

In the present paper, we establish a gluing construction for the Nahm pole solutions to the Kapustin-Witten equations over manifolds with boundaries and cylindrical ends. Given two Nahm pole solutions with some convergence assumptions on the cylindrical ends, we prove that there exists an obstruction class for gluing t…

2017-07-19abs ↗pdf ↗

Flat surfaces that correspond to meromorphic 11-forms or to meromorphic quadratic differentials containing poles of order two and higher are surfaces of infinite area. We classify groups that appear as Veech groups of translation surfaces with poles. We characterize those surfaces such that their $GL^{+}(2,\mathbb{R})…

2016-06-12abs ↗pdf ↗

New examples of manifolds with positive scalar curvature and infinitely many poles.

problem Constructing manifolds with positive scalar curvature and understanding their limits.
method Extending previous examples to create new sequences of manifolds.
result Found new examples of manifolds with infinitely many poles and positive scalar curvature.

Strata of kk-differentials on smooth curves parameterize sections of the kk-th power of the canonical bundle with prescribed orders of zeros and poles. Define the tautological ring of the projectivized strata using the κκ and ψψ classes of moduli spaces of pointed smooth curves along with the tautological class ηη

2017-08-01abs ↗pdf ↗