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,657 papers · 148 categories

Trend · papers per month

18375573 · Jun 202019922001200920172026
48 results for binary neutron stars

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.

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 ↗

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.

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.

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.

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 ↗

Study calibrates high-dimensional binary classifiers using angle between estimator and true weights.

problem Calibrating high-dimensional binary classifiers with provable properties.
method Interpolates with a chance classifier to construct well-calibrated predictor based on angle between estimator and true weights.
result Angular calibration approach is provably well-calibrated in high dimensions, minimizing Bregman divergence.

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.

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.

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.

A method for safe online classification reduces test costs while maintaining low error rates.

problem Sequential testing for binary disease outcomes with unknown logistic model parameters.
method Joint estimation of logistic parameter and feature distribution with a conservative threshold.
result Achieves target error with high probability and requires minimal excess tests.

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.

We study the problem of nonparametric dependence detection. Many existing methods may suffer severe power loss due to non-uniform consistency, which we illustrate with a paradox. To avoid such power loss, we approach the nonparametric test of independence through the new framework of binary expansion statistics (BEStat…

2016-10-17abs ↗pdf ↗

Rotation invariant algorithms fail with hard labels sampled from sparse targets.

problem Rotation invariant algorithms fail to learn from hard labels sampled from sparse targets.
method Proving the excess risk of rotation invariant algorithms and proposing a simple non-rotation invariant algorithm.
result Rotation invariant algorithms incur an excess risk of $Ω\left(\frac{d-1}{n} ight)$, while non-rotation invariant algorithms have an excess risk of $O\left(\frac{s\log d}{n} ight).

Paper addresses limitations of traditional hierarchical clustering methods.

problem Traditional hierarchical clustering methods face limitations in binary trees and ultrametrics.
method Introduces the notion of a valid hierarchy and a two-step algorithm to construct a binary tree and prune it to enforce validity.
result Proposes a method to recover the finest valid hierarchy, which is not constrained to binary structures.

Paper uses machine learning to detect dark matter subhalos in simulated Gaia DR2 data.

problem Detecting dark matter subhalos in simulated Gaia DR2 data.
method Proposed anomaly detection and classification-based approaches.
result Anomaly detection algorithm is sensitive to DM subhalos, but classification-based approach is not.

Paper proves conjecture about star-shaped curves evolving under GAPF, but not always preserves star shape.

problem What conditions guarantee global existence of Gage's area-preserving flow for nonconvex initial curves?
method Using Dittberner's singularity analysis theory, constructed a ``flying wing'' curve to show limitations.
result Gage's area-preserving flow does not always preserve star-shapedness of evolving curves.

In this article, we introduce the notion of star-Ricci tensors in the real hypersurfaces of complex quadric QmQ^m. It is proved that there exist no Hopf hypersurfaces in Qm,m3Q^m,m\geq3, with commuting star-Ricci tensor or parallel star-Ricci tensor. As a generalization of star-Einstein metric, star-Ricci solitons on MM

2017-10-29abs ↗pdf ↗

New set-valued star-shaped risk measures introduced for better risk assessment.

problem Improving risk assessment in financial contexts.
method Developed new set-valued star-shaped risk measures and proved their representation theorems.
result Set-valued star-shaped risk measures can be represented as unions of set-valued convex risk measures.

The paper studies dynamic star-shaped risk measures and their representation.

problem Representing dynamic star-shaped risk measures and their properties.
method Representation theorems for dynamic monetary and star-shaped risk measures.
result Dynamic star-shaped risk measures can be represented as the lower envelope of a family of dynamic convex risk measures.

The paper characterizes dynamic return and star-shaped risk measures via BSDEs.

problem Characterizing dynamic return and star-shaped risk measures.
method Characterization of star-shaped functionals and BSDEs.
result Existence of convex BSDEs with non-empty set of supersolutions.

Deform moment map on symplectic connections using star product algebras.

problem Understanding symplectic connections and their deformations.
method Study vector bundle of Fedosov star product algebras, formal connection, curvature, and star product trace.
result Showed star product trace as a formal symplectic form and moment map.

Paper analyzes Birkhoff relaxation for graph alignment, providing theoretical guarantees.

problem Finding vertex correspondence between two graphs to maximize edge overlap.
method Birkhoff relaxation as a convex relaxation of the quadratic assignment problem (QAP).
result Theoretical guarantees on the performance of Birkhoff relaxation under specific conditions.

New partition designs reduce star discrepancy in high-dimensional sampling.

problem Improving the expected star discrepancy in high-dimensional sampling.
method Developed non-equal volume partitions to achieve lower expected star discrepancy.
result Explicit upper bounds for expected star discrepancy under non-equal volume partitions.

We compare the star surgery operations introduced in [KS] to the generalized rational blow-down. We show that star surgery shares the properties that make rational blow-down useful for constructions of small exotic symplectic 4-manifolds. Then we show that star surgery operations provide a strictly more general class o…

2014-07-11abs ↗pdf ↗

We derive a closed formula for a star-product on complex projective space and on the domain SU(n+1)/S(U(1)×U(n))SU(n+1)/S(U(1)\times U(n)) using a completely elementary construction: Starting from the standard star-product of Wick type on Cn+1{0}C^{n+1} \setminus \{ 0 \} and performing a quantum analogue of Marsden-Weinstein reduction, we ca…

1995-03-09abs ↗pdf ↗

Estimates how many times a star appears due to gravitational lensing.

problem Estimating the number of times an observer sees a star due to gravitational lensing.
method Use affine linking numbers to estimate the number of times an observer sees a star.
result Estimates the number of times an observer sees a star due to gravitational lensing.

Improved SGD learning for single index models reduces sample complexity.

problem Learning a single index model with optimal sample complexity.
method Using smoothed loss in online SGD to reduce sample complexity.
result Online SGD with smoothed loss achieves optimal sample complexity of dk/2d^{k^\star/2}.

Let KK be a nontrivial knot in S3S^{3} and t(K)t(K) its tunnel number. For any (p2,q)(p\geq 2,q)-slope in the torus boundary of a closed regular neighborhood of K K in S3S^{3}, denoted by KK^{\star}, it is a nontrivial cable knot in S3S^{3}. Though t(K)t(K)+1t(K^{\star})\leq t(K)+1, Example 1.1 in Section 1 shows that in some cas…

2020-02-18abs ↗pdf ↗