Related papers: Stable sets mapping with Taylor differential algeb…
We present an algorithm for inferring the dynamical mass of galaxy clusters directly from their respective phase-space distributions, i.e. the observed line-of-sight velocities and projected distances of galaxies from the cluster centre.…
This paper presents a machine learning approach for tuning the parameters of a family of stabilizing controllers for orbital tracking. An augmented random search algorithm is deployed, which aims at minimizing a cost function combining…
Designing efficient, effective, and consistent metric clustering algorithms is a significant challenge attracting growing attention. Traditional approaches focus on the stability of cluster centers; unfortunately, this neglects the…
Surveillance and exploration of large environments is a tedious task. In spaces with limited environmental cues, random-like search is an effective approach as it allows the robot to perform online coverage of environments using simple…
Differentiable Architecture Search (DARTS) has attracted a lot of attention due to its simplicity and small search costs achieved by a continuous relaxation and an approximation of the resulting bi-level optimization problem. However, DARTS…
Understanding the properties of transient gravitational waves and their sources is of broad interest in physics and astronomy. Bayesian inference is the standard framework for astro-physical measurement in transient gravitational-wave…
A new class of integrable maps, obtained as lattice versions of polynomial dynamical systems is introduced. These systems are obtained by means of a discretization procedure that preserves several analytic and algebraic properties of a…
Computing partial differential equation (PDE) operators via nested backpropagation is expensive, yet popular, and severely restricts their utility for scientific machine learning. Recent advances, like the forward Laplacian and randomizing…
Bayesian estimation with an explicit transitional prior is required for a tracking algorithm to be embedded in most multi-target tracking frameworks. This paper describes a novel approach capable of tracking maneuvering spacecraft with an…
The key innovation of our analytical method, CaRT, lies in establishing a new hierarchical, distributed architecture to guarantee the safety and robustness of a given learning-based motion planning policy. First, in a nominal setting, the…
We present a novel view of nonlinear manifold learning using derivative-free optimization techniques. Specifically, we propose an extension of the classical multi-dimensional scaling (MDS) method, where instead of performing gradient…
Stochastic Gradient Descent (SGD) is an important algorithm in machine learning. With constant learning rates, it is a stochastic process that, after an initial phase of convergence, generates samples from a stationary distribution. We show…
Moment-based estimation filters have successfully aided spacecraft navigation for decades. However, future missions plan to venture into deep-space regimes with significant round-trip light-time telecommunication delays, operate in…
The search of high-order periodic orbits has been typically restricted to problems with symmetries that help to reduce the dimension of the search space. Well-known examples include reversible maps with symmetry lines. The present work…
Modern galaxy surveys demand extensive survey volumes and resolutions surpassing current dark matter-only simulations' capabilities. To address this, many methods employ effective bias models on the dark matter field to approximate object…
Recent research has emphasized the benefits of accurately reconstructing the initial Lagrangian positions of biased tracers from their positions at a later time, to gain cosmological information. A weighted semi-discrete optimal transport…
The paper studies the optimal density steering problem for nonlinear continuous-time stochastic systems. To accurately capture nonlinear dynamics in high-uncertainty regions that deviate significantly from a nominal linearization point, we…
Picking unseen objects from clutter is a difficult problem because of the variability in objects (shape, size, and material) and occlusion due to clutter. As a result, it becomes difficult for grasping methods to segment the objects…
High-contrast imaging surveys for exoplanet detection have shown giant planets at large separations to be rare. It is important to push towards detections at smaller separations, the part of the parameter space containing most planets. The…
Dynamic topic models (DTMs) are very effective in discovering topics and capturing their evolution trends in time series data. To do posterior inference of DTMs, existing methods are all batch algorithms that scan the full dataset before…