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

17345168 · May 202619922001200920172026
48 results for neutron transport

This paper applies reactor theory to supply chain management.

problem Maintaining optimal item delivery and collection ratios in supply chains.
method Translating neutron transport and diffusion theory to supply chain management, introducing analogy factors and interactors.
result A deterministic model for supply chain optimization.

The paper tackles inverse uncertainty quantification in neutron noise analysis.

problem Uncertainty in estimating material properties from noisy neutron correlation measurements.
method Surrogate models and inverse uncertainty quantification to account for measurement error and model bias.
result Improved prediction of neutron correlations and quantification of uncertainties.

Machine learning helps create accurate models of neutron star postmerger signals.

problem Creating accurate postmerger waveforms for binary neutron stars is challenging due to theoretical uncertainties and limited numerical simulations.
method Used a conditional variational autoencoder (CVAE) to construct postmerger models based on numerical-relativity simulations.
result The CVAE can accurately generate postmerger waveforms and encode the neutron star equation of state.

The region of heavy calcium isotopes forms the frontier of experimental and theoretical nuclear structure research where the basic concepts of nuclear physics are put to stringent test. The recent discovery of the extremely neutron-rich nuclei around 60^{60}Ca [Tarasov, 2018] and the experimental determination of masse…

2019-01-22abs ↗pdf ↗

Active learning improves neutron spectroscopy experiments by automating measurement selection.

problem Efficiently searching for signals in neutron scattering experiments with limited beam time.
method Probabilistic active learning using log-Gaussian processes.
result Automated selection of informative measurements improves experimental efficiency.

ANNs predict SAFARI-1 neutron fluxes with uncertainties.

problem Uncertainty quantification in ANN predictions for SAFARI-1.
method Deep Neural Networks (DNNs) with Monte Carlo Dropout (MCD) and Bayesian Neural Networks (BNN VI) for uncertainty quantification.
result Uncertainty bands envelop noisy measurement data points, indicating good prediction and generalization.

In X-ray binary star systems consisting of a compact object that accretes material from an orbiting secondary star, there is no straightforward means to decide if the compact object is a black hole or a neutron star. To assist this classification, we develop a Bayesian statistical model that makes use of the fact that …

2015-07-13abs ↗pdf ↗

Young isolated neutron stars (INS) most commonly manifest themselves as rotationally powered pulsars (RPPs) which involve conventional radio pulsars as well as gamma-ray pulsars (GRPs) and rotating radio transients (RRATs). Some other young INS families manifest themselves as anomalous X-ray pulsars (AXPs) and soft gam…

2019-04-08abs ↗pdf ↗

Paper uses autoencoders for efficient reduced-order modeling of eigenvalue problems.

problem Efficiently modeling eigenvalue problems in high dimensions.
method Autoencoder-based reduced-order modeling for eigenvalue problems.
result Autoencoder-based models outperform standard POD-Galerkin methods in neutron diffusion applications.

The main task in oil and gas exploration is to gain an understanding of the distribution and nature of rocks and fluids in the subsurface. Well logs are records of petro-physical data acquired along a borehole, providing direct information about what is in the subsurface. The data collected by logging wells can have si…

2017-05-10abs ↗pdf ↗

New method finds all thin film structures from reflectometry data.

problem Computational prohibitive for standard algorithms, leading to unreliable analysis.
method Prior-Amortized Neural Posterior Estimation (PANPE) combining simulation-based inference and adaptive priors.
result Identifies all realistic structures in seconds, setting new standards in reflectometry.

Accelerates pulsar light curve inference with learned representations and optimization.

problem Computational expense of Markov chain Monte Carlo methods for posterior inference.
method Combining U-Net latent representations with local simulator-guided optimization.
result 120x reduction in inference time (24 hours to 12 minutes) with accuracy preserved.

Recently, it has been shown that Absolute Parallelism (AP) geometry admits paths that are naturally quantized. These paths have been used to describe the motion of spinning particles in a background gravitational field. In case of a weak static gravitational field limits, the paths are applied successfully to interpret…

2006-05-06abs ↗pdf ↗

New method uses SBI to infer magnetorotational properties of isolated pulsars.

problem Constrain magnetorotational properties of isolated Galactic radio pulsars.
method Combines population synthesis with SBI to model neutron star birth and evolution.
result Inferred μlogB=13.100.10+0.08μ_{\log B} = 13.10^{+0.08}_{-0.10}, σlogB=0.450.05+0.05σ_{\log B} = 0.45^{+0.05}_{-0.05} for lognormal distributions.

New methods estimate transport-growth pairs in unbalanced optimal transport.

problem Statistical guarantees for Monge-type estimation in unbalanced optimal transport remain limited.
method Developed two estimators for transport-growth pairs under different setups.
result Achieved minimax optimal rate for estimation of transport-growth pairs.

Study shows how optimal transport behaves in higher dimensions.

problem Characterizing optimal transport in higher dimensions with Euclidean distance.
method Investigates the small regularization limit of entropic optimal transport.
result The limiting transport plan is supported on transport rays and uniquely minimizes a relative entropy functional.

Under mild regularity assumptions, the transport problem is stable in the following sense: if a sequence of optimal transport plans π1,π2,π_1, π_2, \ldots converges weakly to a transport plan ππ, then ππ is also optimal (between its marginals). Alfonsi, Corbetta and Jourdain asked whether the same property is true for th…

2019-04-08abs ↗pdf ↗

New algorithm solves unbalanced optimal transport on trees in quasi-linear time.

problem Efficiently solving unbalanced optimal transport problems on trees.
method Proposed an algorithm that solves a more general unbalanced optimal transport problem exactly in quasi-linear time on a tree metric.
result Solves unbalanced optimal transport on trees in quasi-linear time (less than one second for a tree with one million nodes).

A new algorithm for parallel transport on shape spaces is presented and compared to existing methods.

problem Statistical analysis of shape data, especially in time series and optimization.
method Pole ladder algorithm for parallel transport on Kendall shape spaces, compared to integration methods.
result The pole ladder algorithm is a more efficient method for parallel transport.

Extends optimal transport to dynamic and martingale settings.

problem Dynamic and martingale relaxation of optimal transport problems.
method Extends Benamou-Brenier formula to weak optimal transport and introduces barycentric optimal transport.
result Relates barycentric optimal transport to martingale Benamou-Brenier formula.

Review of modern computational optimal transport methods for biomedical applications.

problem Efficient computation of optimal transport for big data.
method Regularization-based and projection-based computational methods.
result Advancements in computational optimal transport methods for biomedical research.

Paper relaxes optimal transport using convex functions for data science.

problem Optimal transport problem on finite spaces.
method Relaxation via strictly convex functions (Kullback-Leibler divergence, Bregman divergences). Gradient descent iterative process.
result Mathematical foundations and iterative process for the relaxed optimal transport problem.

Study optimal transport on simplex boundary, proving transport map and potential regularity.

problem Regularity of transport map and potential on simplex boundary.
method Boundary regularity results for optimal transport maps, exploiting simplex symmetries.
result Regularity properties of transport map and its convex potential.

TSC uses HMC and adaptive transport maps to optimize forward KL for variational inference.

problem Variational inference underestimates uncertainty when minimizing reverse KL.
method TSC uses Hamiltonian Monte Carlo and adaptive transport maps to optimize KL(p||q).
result TSC achieves competitive performance in training variational autoencoders on large-scale data.

In this paper, we present a novel and principled approach to learn the optimal transport between two distributions, from samples. Guided by the optimal transport theory, we learn the optimal Kantorovich potential which induces the optimal transport map. This involves learning two convex functions, by solving a novel mi…

2019-08-28abs ↗pdf ↗

A new model corrects inhomogeneity in Optimal Transport with Boundary.

problem Inhomogeneity in UROT models for Optimal Transport with Boundary.
method Proposed a modified entropic regularization term to make UROT models homogeneous.
result Homogeneous UROT model preserves properties of standard UROT while correcting inhomogeneity.

Paper investigates optimal transport map estimation in infinite-dimensional spaces.

problem Estimating optimal transport maps in infinite-dimensional spaces is challenging.
method Characterizes γγ-smoothness for optimal transport maps and develops a polynomial-rate estimator.
result Shows polynomial-order minimax risk for optimal transport map estimation.