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

2579 · Oct 201819922001200920172026
48 results for nuclear Fréchet

The asymptotic concentration of the Fr{é}chet mean of IID random variables on a Rieman-nian manifold was established with a central limit theorem by Bhattacharya \& Patrangenaru (BP-CLT) [6]. This asymptotic result shows that the Fr{é}chet mean behaves almost as the usual Euclidean case for sufficiently concentrated di…

2019-06-18abs ↗pdf ↗

The paper introduces new geometric methods to analyze radar electromagnetic wave statistics.

problem Analyzing spatio-temporal and polarimetric fluctuations of radar electromagnetic waves.
method Using statistical mechanics and Information Geometry, the paper defines a Fréchet barycentre and maximum entropy density for radar measurements.
result New tools for describing radar electromagnetic wave fluctuations, including a distance on covariance matrices.

In [16], a new family of vector-valued risk measures called multivariate expectiles is introduced. In this paper, we focus on the asymptotic behavior of these measures in a multivariate regular variations context. For models with equivalent tails, we propose an estimator of these multivariate asymptotic expectiles, in …

2017-04-24abs ↗pdf ↗

New metrics defined for full-rank correlation matrices, ensuring unique operations.

problem No suitable problem statement as the abstract does not describe a problem to be solved.
method New Riemannian metrics defined on full-rank correlation matrices, providing unique operations.
result Unique Riemannian logarithm and Fréchet mean defined for full-rank correlation matrices.

New formulas for geodesics on Stiefel and flag manifolds using trust-region method.

problem Computing geodesics and logarithms on Stiefel and flag manifolds.
method Closed-form geodesic formulas, trust-region solver, Fréchet derivatives.
result Efficient computation of geodesic distance and logarithm map.

Let GG be a compact connected simple Lie group and let $M=G^{\bb{C}}/P=G/K$ be a generalized flag manifold. In this article we focus on an important invariant of G/KG/K, the so called $\fr{t}$-root system $R_{\fr{t}}$, and we introduce the notion of symmetric $\fr{t}$-triples, that is triples of $\fr{t}$-roots $ξ, ζ, η…

2010-10-19abs ↗pdf ↗

A new method for estimating large-scale linear models with improved precision.

problem Estimating large-scale linear statistical models efficiently.
method Sequential Least-Squares Estimators with Fast Randomized Sketching (SLSE-FRS), integrating Sketch-and-Solve and Iterative-Sketching methods.
result SLSE-FRS produces high-precision estimators, outperforming state-of-the-art methods.

Study shows splitting schemes can approximate WFR flows faster than the exact flow.

problem Improving sampling efficiency in Wasserstein-Fisher-Rao gradient flows.
method Investigates operator splitting techniques to numerically approximate WFR flows.
result A judicious choice of step size and operator ordering can lead to faster convergence of split schemes to the target distribution.

Phishing as one of the most well-known cybercrime activities is a deception of online users to steal their personal or confidential information by impersonating a legitimate website. Several machine learning-based strategies have been proposed to detect phishing websites. These techniques are dependent on the features …

2019-03-13abs ↗pdf ↗

FR-Train improves fair and robust AI training by detecting and reducing poisoned data.

problem Training AI models that are fair and robust in the presence of data bias and poisoning.
method Mutual information-based adversarial training with an additional discriminator.
result FR-Train maintains fairness and accuracy even in the presence of poisoned data.

Proves FR-NGD optimally approximates evolutionary dynamics and continuous Bayesian inference.

problem Optimizing continuous time replicator equations and continuous Bayesian inference.
method Fisher-Rao natural gradient descent (FR-NGD) and its correspondence with evolutionary dynamics.
result FR-NGD optimally approximates continuous time replicator equations and continuous Bayesian inference.

FR-LUX optimizes portfolio management by learning cost-aware policies robust to market conditions.

problem Transaction costs and regime shifts cause failure in live trading portfolios.
method Integrates three ingredients: microstructure-consistent execution model, trade-space trust region, and explicit regime conditioning.
result Achieves top average Sharpe ratio, maintains flat cost-performance slope, and superior risk-return efficiency.

Consider an anchored bundle (E,ρ)(E,ρ), i.e. a vector bundle EME\to M equipped with a bundle map ρ ⁣:ETMρ\colon E \to TM covering the identity. M.~Kapranov showed in the context of Lie-Rinehard algebras that there exists an extension of this anchored bundle to an infinite rank universal free Lie algebroid FR(E)EFR(E)\supset E. We …

2019-04-11abs ↗pdf ↗

This study provides an explicit expansion of KL divergence's gradient flow in Fisher-Rao geometry.

problem Sampling techniques struggle to traverse between modes in non-convex potential functions.
method Explicit expansion of KL divergence's gradient flow in Fisher-Rao geometry.
result The convergence rate to π is independent of the potential function.

We study geodesics of the form γ(t)=π(exp(tX)exp(tY))γ(t)=π(\exp(tX)\exp(tY)), $X,Y\in \fr{g}=\operatorname{Lie}(G)$, in homogeneous spaces G/KG/K, where π:GG/Kπ:G\rightarrow G/K is the natural projection. These curves naturally generalise homogeneous geodesics, that is orbits of one-parameter subgroups of GG (i.e. γ(t)=π(exp(tX))γ(t)=π(\exp (tX)), $X\in …

2016-11-14abs ↗pdf ↗

We study geodesics in generalized Wallach spaces which are expressed as orbits of products of three exponential terms. These are homogeneous spaces M=G/KM=G/K whose isotropy representation decomposes into a direct sum of three submodules m=m1m2m3\frak{m}=\frak{m}_1\oplus\frak{m}_2\oplus\frak{m}_3, satisfying the relations $[\fr…

2015-03-14abs ↗pdf ↗

This article follow the article {http://hal.archives-ouvertes.fr/hal-00361030/fr/} in which the author characterize the fact of being of finite volume for a convex projective surface. We show here that the moduli space βf(Σg,p)β_f(Σ_{g,p}) of the convex projective structure on the surface Σg,pΣ_{g,p} of genius gg with pp pun…

2009-10-30abs ↗pdf ↗

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.

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.

We introduce \texttt{pycobra}, a Python library devoted to ensemble learning (regression and classification) and visualisation. Its main assets are the implementation of several ensemble learning algorithms, a flexible and generic interface to compare and blend any existing machine learning algorithm available in Pytho…

2017-04-25abs ↗pdf ↗

Study reveals centralization in Bitcoin transactions involving retail users.

problem Centralization and bias in Bitcoin transaction data.
method Heuristic classification of Bitcoin users, weekly activity pattern analysis.
result Most real transactions involve Frequent Receivers, centralizing the ecosystem.

Many tasks in modern machine learning can be formulated as finding equilibria in \emph{sequential} games. In particular, two-player zero-sum sequential games, also known as minimax optimization, have received growing interest. It is tempting to apply gradient descent to solve minimax optimization given its popularity a…

2019-10-16abs ↗pdf ↗

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.

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 ↗

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.

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.

We construct examples of finitely generated groups L that have non-trivial actions on R\mathbb{R}-trees but which cannot act, without fixing a vertex, on any simplicial tree. Moreover, any finitely presented group mapping onto L does have a fixed point-free action on some simplicial tree.

2012-03-15abs ↗pdf ↗

Improved action recognition in live videos with hybrid FR-DL method.

problem High computational costs and lack of temporal information in conventional action recognition.
method Automated selection of representative frames, feature extraction, background subtraction, HOG, deep neural network, LSTM, Softmax-KNN classifier.
result Significant improvement in accuracy and speed compared to state-of-the-art methods.

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.

Unified framework for discrete diffusion modeling with flexible noising processes.

problem Efficient modeling of large discrete state spaces with arbitrary corruption dynamics.
method Generalized Discrete Diffusion from Snapshots (GDDS) framework that supports uniformization for fast noising and snapshot-based ELBO for reverse process.
result GDDS outperforms existing discrete diffusion methods in training efficiency and generation quality.

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.

New algorithm for multi-armed bandits with delayed, partially observed rewards.

problem Sequential decision-making with delayed feedback.
method Proposed multi-armed bandits with generalized temporally-partitioned rewards, introducing β-spread property.
result Upper bound on performance of TP-UCB-FR-G algorithm improves state of the art.