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

3537061,0581,411 · Jun 202019922001200920172026
48 results for nuclear mass models

The study uses statistical methods to analyze nuclear mass models.

problem Understanding the information content of nuclear masses from models.
method Bayesian calibration, Bayesian model averaging, chi-square correlation analysis, principal component analysis.
result A dramatic parameter reduction can be achieved in both 4-parameter and 14-parameter models.

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 ↗

The mass, or binding energy, is the basis property of the atomic nucleus. It determines its stability, and reaction and decay rates. Quantifying the nuclear binding is important for understanding the origin of elements in the universe. The astrophysical processes responsible for the nucleosynthesis in stars often take …

2018-06-01abs ↗pdf ↗

Bayesian framework mixes imperfect models for improved predictions.

problem Improving predictions of complex computational models in unknown domains.
method Local Bayesian Dirichlet mixing of imperfect models using the Dirichlet distribution.
result Global and local mixtures of models achieve excellent performance in prediction accuracy and uncertainty quantification.

Minimizing the nuclear norm of a matrix has been shown to be very efficient in reconstructing a low-rank sampled matrix. Furthermore, minimizing the sum of nuclear norms of matricizations of a tensor has been shown to be very efficient in recovering a low-Tucker-rank sampled tensor. In this paper, we propose to recover…

2017-07-25abs ↗pdf ↗

Efficiently regularizes deep learning models using Jacobian nuclear norm.

problem Regularizing deep learning models to prevent overfitting and improve generalization.
method Proposes a denoising-style approximation to penalize the Jacobian nuclear norm without computing the Jacobian matrix.
result Demonstrates that penalizing the average squared Frobenius norm of JgJg and JhJh is equivalent to penalizing the Jacobian nuclear norm for function compositions.

Paper tackles robust prediction of nuclear reactor materials under scarce data.

problem Challenges of data scarcity and uncertainty in nuclear reactor design.
method Meta-learning approach informed by uncertainty and prior knowledge.
result Achieves superior performance in rupture life prediction.

Study on tensor nuclear norm's decomposability and subdifferential.

problem Understanding tensor nuclear norm in higher-order tensors.
method Showed decomposability over specific subspaces, derived subdifferential inclusions, and studied subgradients.
result Established the statistical performance of tensor robust principal component analysis.

In this paper we investigate panel regression models with interactive fixed effects. We propose two new estimation methods that are based on minimizing convex objective functions. The first method minimizes the sum of squared residuals with a nuclear (trace) norm regularization. The second method minimizes the nuclear …

2018-10-25abs ↗pdf ↗

Abstract: Extends Drinfeld correspondence to infinite-dimensional Lie groups.

problem Establishing Drinfeld correspondence in infinite dimensions.
method Extending Drinfeld correspondence to Poisson Lie groups and Lie bialgebras in infinite-dimensional settings.
result Extended Drinfeld correspondence to regular Lie groups modeled on nuclear Fréchet and Silva spaces.

Estimates reliability of nuclear fuel using advanced modeling techniques.

problem Determining the reliability of TRISO-coated particle fuel, which has small failure probabilities and expensive computational models.
method Coupled active learning, multifidelity modeling, and subset simulation.
result Multifidelity modeling strategies consistently reduce the number of high-fidelity model calls.

This research assesses uncertainty quantification and sensitivity analysis for DTs in nuclear fuel performance.

problem Understanding the reliability and performance of advanced nuclear fuels using DTs.
method Introduces ML-based uncertainty quantification and sensitivity analysis methods applied to BISON fuel performance code.
result Demonstrates the effectiveness of DTs in multi-criteria decision-making for nuclear fuel performance.

We implement machine learning algorithms to nuclear data. These algorithms are purely data driven and generate models that are capable to capture intricate trends. Gradient boosted trees algorithm is employed to generate a trained model from existing nuclear data, which is used for prediction for data of damping parame…

2019-07-23abs ↗pdf ↗

Paper presents a deep learning framework for faster, more accurate nuclear reactor power prediction.

problem Inaccurate and inefficient modeling of nuclear reactor transients.
method Hybrid digital twin-focused multi-stage deep learning framework using feed-forward neural networks.
result Achieved remarkable accuracy (96% classification, 2.3% MAPE) with noise-enhanced simulated data.

In this paper, a new definition of tensor p-shrinkage nuclear norm (p-TNN) is proposed based on tensor singular value decomposition (t-SVD). In particular, it can be proved that p-TNN is a better approximation of the tensor average rank than the tensor nuclear norm when p < 1. Therefore, by employing the p-shrinkage nu…

2019-07-09abs ↗pdf ↗

Deep learning predicts nuclear equation of state from rotating core collapse GW signals.

problem Classifying the nuclear equation of state from rotating core collapse gravitational wave signals.
method Employed deep convolutional neural networks to classify visual and temporal patterns in GW signals.
result Up to 97% correct classifications of nuclear equation of state in the test set.

Exact partitioning of high-order planted models achieved through convex optimization.

problem Efficiently partitioning hypergraphs generated by high-order planted models.
method Solving a computationally efficient convex optimization problem with a tensor nuclear norm constraint.
result Exact recovery of true underlying cluster structures with high probability.

Deep learning detects corrosion in nuclear fuel canisters.

problem Ensuring safety and integrity of used nuclear fuel dry storage canisters.
method Residual neural networks (ResNets) for real-time corrosion detection of canister images.
result Deep learning approach accurately detects corrosion and classifies canisters as corroded or intact.

New method uses nuclear and ℓ1 penalties for matrix regression, improving brain disorder detection.

problem Modeling high-dimensional matrix predictors with binary responses.
method Convex optimization with ADMM for low-rank and sparse structures.
result Effective in identifying brain disorder-related connectivity patterns.

Improved nuclear cross section fitting with weighted Levenberg-Marquardt method.

problem Challenging optimization in multichannel nuclear cross section data.
method Weighted Levenberg-Marquardt algorithm with Fisher Information Metric.
result More physically consistent fits for raw and smoothed datasets.

Theoretical models of the strong nuclear interaction contain unknown coupling constants (parameters) that must be determined using a pool of calibration data. In cases where the models are complex, leading to time consuming calculations, it is particularly challenging to systematically search the corresponding paramete…

2019-02-03abs ↗pdf ↗

Recently, the \textit{Tensor Nuclear Norm~(TNN)} regularization based on t-SVD has been widely used in various low tubal-rank tensor recovery tasks. However, these models usually require smooth change of data along the third dimension to ensure their low rank structures. In this paper, we propose a new definition of da…

2019-10-26abs ↗pdf ↗

In this paper, we study the problem of approximately computing the product of two real matrices. In particular, we analyze a dimensionality-reduction-based approximation algorithm due to Sarlos [1], introducing the notion of nuclear rank as the ratio of the nuclear norm over the spectral norm. The presented bound has i…

2014-03-30abs ↗pdf ↗

This paper emphasizes the need for uncertainty quantification in data-driven ML models for nuclear engineering.

problem Uncertainty in ML predictions due to data noise, model architecture, and stochastic training.
method Explains and compares uncertainties in physics-based and data-driven models, and presents techniques to quantify ML prediction uncertainties.
result The importance of uncertainty quantification in ML models for nuclear engineering applications.

This study provides an independent, outside-in estimate of the cost and schedule risks of nuclear waste storage projects. Based on a reference class of 216 past, comparable projects, risk of cost overrun was found to be 202% or less, with 80% certainty, i.e., 20% risk of an overrun above 202%. Based on a reference clas…

2019-01-13abs ↗pdf ↗

Matrix rank minimizing subject to affine constraints arises in many application areas, ranging from signal processing to machine learning. Nuclear norm is a convex relaxation for this problem which can recover the rank exactly under some restricted and theoretically interesting conditions. However, for many real-world …

2015-08-18abs ↗pdf ↗

New algorithms solve tensor problems with random components using SDP.

problem Exact tensor nuclear norm, decomposition, and completion for random tensors.
method Degree-4 Sum of Squares (SOS) semidefinite programs.
result Exact solutions for tensor nuclear norm, decomposition, and completion with random asymmetric components.

New method for factor analysis using nuclear and 0\ell_0 norms.

problem Finding a low-rank plus sparse decomposition from noisy covariance matrix.
method Formulated an optimization problem with nuclear norm, 0\ell_0 norm, and KL divergence. Used alternating minimization algorithm.
result Algorithm effectively decomposes covariance matrices in synthetic and real datasets.

We propose an approach to multivariate nonparametric regression that generalizes reduced rank regression for linear models. An additive model is estimated for each dimension of a qq-dimensional response, with a shared pp-dimensional predictor variable. To control the complexity of the model, we employ a functional fo…

2013-01-09abs ↗pdf ↗

Recovering a low-rank tensor from incomplete information is a recurring problem in signal processing and machine learning. The most popular convex relaxation of this problem minimizes the sum of the nuclear norms of the unfoldings of the tensor. We show that this approach can be substantially suboptimal: reliably recov…

2013-07-22abs ↗pdf ↗

Numerous applications in data mining and machine learning require recovering a matrix of minimal rank. Robust principal component analysis (RPCA) is a general framework for handling this kind of problems. Nuclear norm based convex surrogate of the rank function in RPCA is widely investigated. Under certain assumptions,…

2015-11-17abs ↗pdf ↗