Related papers: FANTASY: User-Friendly Symplectic Geodesic Integra…
Optimization under the symplecticity constraint is an approach for solving various problems in quantum physics and scientific computing. Building on the results that this optimization problem can be transformed into an unconstrained problem…
Safe path planning is a crucial component in autonomous robotics. The many approaches to find a collision free path can be categorically divided into trajectory optimisers and sampling-based methods. When planning using occupancy maps, the…
It has previously been shown that varying the numerical timestep during a symplectic orbital integration leads to a random walk in energy and angular momentum, destroying the phase space-conserving property of symplectic integrators. Here…
This paper introduces panoptica, a versatile and performance-optimized package designed for computing instance-wise segmentation quality metrics from 2D and 3D segmentation maps. panoptica addresses the limitations of existing metrics and…
For simulating incompressible flows by projection methods. it is generally accepted that the pressure-correction stage is the most time-consuming part of the flow solver. The objective of the present work is to develop a fast hybrid…
Optimization on manifolds is a class of methods for optimization of an objective function, subject to constraints which are smooth, in the sense that the set of points which satisfy the constraints admits the structure of a differentiable…
We introduce Synference, a new, flexible Python framework for galaxy SED fitting using simulation-based inference (SBI). Synference leverages the Synthesizer package for flexible forward-modelling of galaxy SEDs and integrates the LtU-ILI…
The structure of symplectic integrators up to fourth-order can be completely and analytical understood when the factorization (split) coefficents are related linearly but with a uniform nonlinear proportional factor. The analytic form of…
This research presents FDASynthesis, a novel algorithm designed to generate synthetic GPS trajectory data while preserving privacy. After pre-processing the input GPS data, human mobility traces are modeled as multidimensional curves using…
Providing examples is one of the most common way for end-users to interact with program synthesizers. However, program synthesis systems assume that examples consistent with the program are chosen at random, and do not exploit the fact that…
We introduce a novel numerical method to integrate partial differential equations representing the Hamiltonian dynamics of field theories. It is a multi-symplectic integrator that locally conserves the stress-energy tensor with an excellent…
Thermodynamic and flash equilibrium calculations are the cornerstones of simulation process calculations. The iterative approach, a widely used nonlinear problem-solving technique, relies on derivative calculations throughout the procedure…
Synthetic data generation is a fundamental task for many data management and data science applications. Spatial data is of particular interest, and its sensitive nature often leads to privacy concerns. We introduce GeoPointGAN, a novel…
We take into account the dynamics of three types of models of rotating galaxies in polar coordinates in a rotating frame. Due to non-axisymmetric potential perturbations, the angular momentum varies with time, and the kinetic energy depends…
In this chapter, we identify fundamental geometric structures that underlie the problems of sampling, optimisation, inference and adaptive decision-making. Based on this identification, we derive algorithms that exploit these geometric…
Given a `cost' functional $F$ on paths $\gamma$ in a domain $D\subset\mathbb{R}^d$, in the form $F(\gamma) = \int_0^1 f(\gamma(t),\dot\gamma(t))dt$, it is of interest to approximate its minimum cost and geodesic paths. Let $X_1,\ldots, X_n$…
Recent years have seen rapid increase in the application of machine learning to insurance loss reserving. They yield most value when applied to large data sets, such as individual claims, or large claim triangles. In short, they are likely…
Symplectic quantization is a functional approach to quantum field theory that allows sampling of quantum fluctuations directly in Minkowski space time by means of a generalized Hamiltonian dynamics in an extra time variable $\tau$ which, at…
Among the single-trajectory Gaussian-based methods for solving the time-dependent Schr\"{o}dinger equation, the variational Gaussian approximation is the most accurate one. In contrast to Heller's original thawed Gaussian approximation, it…
(Sub-)millimetre single-dish telescopes feature faster mapping speeds and access larger spatial scales than their interferometric counterparts. However, atmospheric fluctuations tend to dominate their signals and complicate recovery of the…