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.
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,341 papers · 148 categories
Trend · papers per month
48 results for “satellite collision”
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.
Paper improves satellite collision prediction using ML.
problem Current orbit predictions fail due to lack of space data.
method Integrates physics-based models with ML for improved accuracy.
result ML approach reduces prediction errors and improves generalization.
Space debris warnings follow a predictable pattern, allowing timely satellite maneuvers.
problem Estimating when fresh information about space debris will arrive.
method Statistical learning model of the message arrival process, specifically a Bayesian Poisson process.
result The average prediction error for the next message arrival time is smaller than baseline predictions.
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.
Optimal alarms detect vehicle collisions with theoretical and empirical validation.
problem Detecting dangerous vehicle collisions in real-time.
method Surveyed and compared three classes of collision detection techniques: Monte Carlo, deterministic approximations, and machine learning.
result Monte Carlo sampling is a robust solution for real-time collision detection despite its simplicity.
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.
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.
Deep neural network approximates collision avoidance table for aircraft systems.
problem High dimensionality of collision avoidance state space leads to large numeric tables.
method Used deep neural networks to approximate the numeric tables, using asymmetric loss functions and gradient descent.
result Reduced storage space by a factor of 1000, enabling current avionics systems.
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.
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.
Study multiplayer bandits without collision info, achieving regret bounds.
problem Multiplayer bandits without collision info.
method Two feedback models considered; algorithms for both models.
result First theoretical guarantees for second model with square-root regret.
Classifiers for centrality determination in proton-nucleus and nucleus-nucleus collisionsphysics.data-an
Develops machine learning classifiers for better centrality estimation in proton-nucleus and nucleus-nucleus collisions.
problem Direct measurement of centrality in A-A and p-A collisions is challenging due to limited data access.
method Uses machine learning techniques to classify centrality based on information from multiple detector subsystems.
result Improved centrality resolution can reduce volume fluctuations impact on physical observables.
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.
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.
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.
This study uses reinforcement learning to mitigate imminent collisions by controlling car speed and direction.
problem Mitigating imminent collisions on roads.
method Constructed a model using camera images to predict obstacle dynamics. Trained reinforcement learning policies to control braking and steering.
result Both reinforcement learning policies outperform a baseline policy, with the injury model-based policy showing the highest performance.
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.
New satellite constructions create infinite Brunnian links.
problem Creating new Brunnian links from existing ones.
method Satellite sum and satellite tie constructions.
result Every Brunnian link has a unique tree-arrow structure.
Formula for τ-invariant of satellite knots derived from L-space satellite operators.
problem Calculating the τ-invariant of satellite knots using L-space satellite operators.
method Algorithm to compute knot Floer complexes and formula for τ-invariant.
result Formula recovers existing formulas and proves new properties of τ-invariant.
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.
Satellite knots can be trivialized by a single band move.
problem Satellite knots and their trivialization.
method Infinite family of satellite knots and a single band move.
result No disjoint band unknotting exists for satellite knots.
New configuration space accounts for spatial linkages and collisions.
problem Modeling spatial linkages considering collisions.
method Constructed completed and simplified configuration spaces.
result New configuration spaces account for linkages touching each other.
This study analyzes satellite communication latency using a stochastic geometry model.
problem Latency analysis of LEO satellite relay communication systems.
method Stochastic geometry framework with spherical BPP models, suboptimal satellite relay selection strategy.
result Derives distance distributions and analytical expressions for transmission delays.
Satellite links of fully positive braids are characterized.
problem Characterizing satellite links of fully positive braids.
method Analyzing fully positive braids and their satellites.
result Satellite links of fully positive braids are characterized by specific conditions.
Any knot in a solid torus, called a pattern or satellite operator, acts on knots in the 3-sphere via the satellite construction. We introduce a generalization of satellite operators which form a group (unlike traditional satellite operators), modulo a generalization of concordance. This group has an action on the set o…
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.
PUMML uses ML to remove pileup contamination in particle collisions.
problem Contamination from pileup affects the energy distribution of primary collisions.
method Developed a machine learning algorithm using convolutional neural networks.
result The PUMML algorithm effectively removes pileup distortion on various jet observables.
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…
Satellite operations have infinite rank in smooth concordance group.
problem Understanding satellite operations in the smooth concordance group.
method Reduction to winding number zero satellites and use of gauge theory.
result Provides a criterion for satellite operations to generate infinite rank subgroups.
Satellite links with many twists have simpler companions.
problem Relationship between satellite and companion links' complexity.
method Constructing satellite links with multiple full twists and analyzing their companion links.
result Satellite links with many twists have simpler companion links.
Develops a new framework for integrating satellite allocations in small portfolios.
problem Feasibility constraints in small portfolios, not return predictability, are the primary concerns.
method A four-layer feasibility framework: physical, economic, structural, and epistemic.
result Closed-form feasibility bounds on satellite size, turnover, and breadth without return forecasts.
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.
New methods link Legendrian satellites to Lagrangian cobordisms.
problem Understanding relations between Legendrian and Lagrangian knots.
method Constructing Lagrangian concordances through satellite operations.
result Maximum Thurston-Bennequin number restricts Legendrian satellite Lagrangian sliceness.
FedSpace optimizes ML training on satellites and ground stations.
problem Training machine learning models on satellites with limited bandwidth.
method Federated Learning framework that dynamically schedules model aggregation based on satellite orbits.
result Reduces training time by 1.7 days over state-of-the-art algorithms.
New algorithm syncs multi-player bandits by deliberately causing collisions.
problem Stochastic multiplayer multi-armed bandit problem with collisions.
method Decentralized algorithm that exploits communication between players to share information.
result Achieves performance of centralized algorithm with negligible cost.
New proof for minimizing tunnel systems in satellite chain links.
problem Minimizing the tunnel number of satellite chain links.
method Proving the tunnel number is minimized for links with a specific number of components and bridge number.
result The result is sharp for satellite chain links over a 2-bridge knot.
The Gluck twist preserves the diffeomorphism type of certain satellite 2-knots.
problem Preserving the diffeomorphism type of satellite 2-knots under the Gluck twist.
method Using new descriptions of satellite 2-knots, the paper shows that the Gluck twist does not change the diffeomorphism type of certain satellite 2-knots in three ways.
result The Gluck twist preserves the diffeomorphism type of certain satellite 2-knots.
Researchers compute Khovanov polynomials for satellite knots.
problem Computing Khovanov polynomials for satellite knots.
method Explicit computation using a computer program for two families of satellite knots.
result Khovanov polynomials can be expressed as a linear combination of pattern and companion invariants, with a jump at a critical point.
Satellites and Lorenz knotsmath.GT
New satellite knots counter a conjecture about Lorenz knots.
problem A conjecture about satellite knots and Lorenz knots was disproven.
method Constructed infinitely many counterexamples of satellite knots that are not cables.
result The conjecture was amended and shown to hold for many Lorenz knots.