Paper presents a deep learning framework for faster, more accurate nuclear reactor power prediction.
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.
Trend · papers per month
DeepONet accelerates nuclear DT inference with high accuracy and efficiency.
This research assesses uncertainty quantification and sensitivity analysis for DTs in nuclear fuel performance.
We numerically study an Asset Liability Management problem linked to the decommissioning of French nuclear power plants. We link the risk aversion of practitioners to an optimization problem. Using different price models we show that the optimal solution is linked to a de-risking management strategy similar to a concav…
In the first section, this report analyses Nuclear Power Plants (NPPs) in the context of megaprojects, explaining why they are often delivered over budget and late. In the second section, the report discusses how Small Modular Reactors (SMRs) might address these issues. Megaprojects are extremely risky and often implem…
Neural surrogates speed up 5D gyrokinetic simulations of plasma turbulence.
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 …
This paper emphasizes the need for uncertainty quantification in data-driven ML models for nuclear engineering.
Kolmogorov-Arnold Networks offer interpretable models for energy applications.
NukeBERT improves performance on nuclear domain Q&A with less training data.
Study on tensor nuclear norm's decomposability and subdifferential.
Efficiently regularizes deep learning models using Jacobian nuclear norm.
The limits of the nuclear landscape are determined by nuclear binding energies. Beyond the proton drip lines, where the separation energy becomes negative, there is not enough binding energy to prevent protons from escaping the nucleus. Predicting properties of unstable nuclear states in the vast territory of proton em…
Low-rank matrix recovery has found many applications in science and engineering such as machine learning, signal processing, collaborative filtering, system identification, and Euclidean embedding. But the low-rank matrix recovery problem is an NP hard problem and thus challenging. A commonly used heuristic approach is…
Paper tackles robust prediction of nuclear reactor materials under scarce data.
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…
Deep learning predicts nuclear equation of state from rotating core collapse GW signals.
Nuclear segmentation in histology images is a challenging task due to significant variations in the shape and appearance of nuclei. One of the main hurdles in nuclear instance segmentation is overlapping nuclei where a smart algorithm is needed to separate each nucleus. In this paper, we introduce a proposal-free deep …
The chart of the nuclides is limited by particle drip lines beyond which nuclear stability to proton or neutron emission is lost. Predicting the range of particle-bound isotopes poses an appreciable challenge for nuclear theory as it involves extreme extrapolations of nuclear masses beyond the regions where experimenta…
Deep learning detects corrosion in nuclear fuel canisters.
Study uses deep reinforcement learning for real-time control of nuclear microreactors, achieving similar or superior performance to traditional PID controllers.
This work investigates implicit bias in multiclass separable data using a novel geometry-aware optimizer.
Recently theoretical guarantees have been obtained for matrix completion in the non-uniform sampling regime. In particular, if the sampling distribution aligns with the underlying matrix's leverage scores, then with high probability nuclear norm minimization will exactly recover the low rank matrix. In this article, we…
Motivated by the asset-liability management of a nuclear power plant operator, we consider the problem of finding the least expensive portfolio, which outperforms a given set of stochastic benchmarks. For a specified loss function, the expected shortfall with respect to each of the benchmarks weighted by this loss func…
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…
We present a conditional generative model to learn variation in cell and nuclear morphology and the location of subcellular structures from microscopy images. Our model generalizes to a wide range of subcellular localization and allows for a probabilistic interpretation of cell and nuclear morphology and structure loca…
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 …
Recovering a large matrix from limited measurements is a challenging task arising in many real applications, such as image inpainting, compressive sensing and medical imaging, and this kind of problems are mostly formulated as low-rank matrix approximation problems. Due to the rank operator being non-convex and discont…
Abstract: Extends Drinfeld correspondence to infinite-dimensional Lie groups.
We propose the nuclear norm penalty as an alternative to the ridge penalty for regularized multinomial regression. This convex relaxation of reduced-rank multinomial regression has the advantage of leveraging underlying structure among the response categories to make better predictions. We apply our method, nuclear pen…
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…
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…
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…
Rank minimization has attracted a lot of attention due to its robustness in data recovery. To overcome the computational difficulty, rank is often replaced with nuclear norm. For several rank minimization problems, such a replacement has been theoretically proven to be valid, i.e., the solution to nuclear norm minimiza…
Low-rank modeling has a lot of important applications in machine learning, computer vision and social network analysis. While the matrix rank is often approximated by the convex nuclear norm, the use of nonconvex low-rank regularizers has demonstrated better recovery performance. However, the resultant optimization pro…
New algorithms solve tensor problems with random components using SDP.
New method uses nuclear and ℓ1 penalties for matrix regression, improving brain disorder detection.
In this paper, we consider the Tensor Robust Principal Component Analysis (TRPCA) problem, which aims to exactly recover the low-rank and sparse components from their sum. Our model is based on the recently proposed tensor-tensor product (or t-product). Induced by the t-product, we first rigorously deduce the tensor sp…
Low-rank modeling has many important applications in computer vision and machine learning. While the matrix rank is often approximated by the convex nuclear norm, the use of nonconvex low-rank regularizers has demonstrated better empirical performance. However, the resulting optimization problem is much more challengin…
New method for factor analysis using nuclear and norms.
Estimates reliability of nuclear fuel using advanced modeling techniques.
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,…
Optimization problems with rank constraints appear in many diverse fields such as control, machine learning and image analysis. Since the rank constraint is non-convex, these problems are often approximately solved via convex relaxations. Nuclear norm regularization is the prevailing convexifying technique for dealing …
Improved nuclear cross section fitting with weighted Levenberg-Marquardt method.
In recent years, the nuclear norm minimization (NNM) problem has been attracting much attention in computer vision and machine learning. The NNM problem is capitalized on its convexity and it can be solved efficiently. The standard nuclear norm regularizes all singular values equally, which is however not flexible enou…
Representation and classification of Electroencephalography (EEG) brain signals are critical processes for their analysis in cognitive tasks. Particularly, extraction of discriminative features from raw EEG signals, without any pre-processing, is a challenging task. Motivated by nuclear norm, we observed that there is …
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…
Extended Gauss-Markov theorem for linear estimation with bounded bias.