اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe Wasserstein-Fisher-Rao metric for waveform based earthquake location
62
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In our previous work [Chen el al., J. Comput. Phys., 373(2018)], the quadratic Wasserstein metric is successfully applied to the earthquake location problem. The actual earthquake hypocenter can be accurately recovered starting from initial values very far from the true ones. However, the seismic wave signals need to be normalized since the quadratic Wasserstein metric requires mass conservation. This brings a critical difficulty. Since the amplitude of a seismogram at a receiver is a good representation of the distance between the source and the receiver, simply normalizing the signals will cause the objective function in optimization process to be insensitive to the distance between the source and the receiver. When the data is contaminated with strong noise, the minimum point of the objective function will deviate and lead to a low accurate location result. To overcome the difficulty mentioned above, we apply the Wasserstein-Fisher-Rao (WFR) metric [Chizat et al., Found. Comput. Math., 18(2018)] to the earthquake location problem. The WFR metric is one of the newly developed metric in the unbalanced Optimal Transport theory. It does not require the normalization of the seismic signals. Thus, the amplitude of seismograms can be considered as a new constraint, which can substantially improve the sensitivity of the objective function to the distance between the source and the receiver. As a result, we can expect more accurate location results from the WFR metric based method compare to those based on quadratic Wasserstein metric under high-intensity noise. The numerical examples also demonstrate this.
قيم البحث
اقرأ أيضاً
On a closed manifold of dimension greater than one, every smooth weak Riemannian metric on the space of smooth positive probability densities, that is invariant under the action of the diffeomorphism group, is a multiple of the Fisher--Rao metric.
The purpose of this article is to exploit the geometric structure of Quantum Mechanics and of statistical manifolds to study the qualitative effect that the quantum properties have in the statistical description of a system. We show that the end poin
ts of geodesics in the classical setting coincide with the probability distributions that minimise Shannons Entropy, i.e. with distributions of zero dispersion. In the quantum setting this happens only for particular initial conditions, which in turn correspond to classical submanifolds. This result can be interpreted as a geometric manifestation of the uncertainty principle.
It is known that on a closed manifold of dimension greater than one, every smooth weak Riemannian metric on the space of smooth positive densities that is invariant under the action of the diffeomorphism group, is of the form $$ G_mu(alpha,beta)=C_1(
mu(M)) int_M frac{alpha}{mu}frac{beta}{mu},mu + C_2(mu(M)) int_Malpha cdot int_Mbeta $$ for some smooth functions $C_1,C_2$ of the total volume $mu(M)$. Here we determine the geodesics and the curvature of this metric and study geodesic and metric completeness.
In this paper, we study the geometry induced by the Fisher-Rao metric on the parameter space of Dirichlet distributions. We show that this space is geodesically complete and has everywhere negative sectional curvature. An important consequence of thi
s negative curvature for applications is that the Fr{e}chet mean of a set of Dirichlet distributions is uniquely defined in this geometry.
Adversarial robustness has become a topic of growing interest in machine learning since it was observed that neural networks tend to be brittle. We propose an information-geometric formulation of adversarial defense and introduce FIRE, a new Fisher-R
ao regularization for the categorical cross-entropy loss, which is based on the geodesic distance between natural and perturbed input features. Based on the information-geometric properties of the class of softmax distributions, we derive an explicit characterization of the Fisher-Rao Distance (FRD) for the binary and multiclass cases, and draw some interesting properties as well as connections with standard regularization metrics. Furthermore, for a simple linear and Gaussian model, we show that all Pareto-optimal points in the accuracy-robustness region can be reached by FIRE while other state-of-the-art methods fail. Empirically, we evaluate the performance of various classifiers trained with the proposed loss on standard datasets, showing up to 2% of improvements in terms of robustness while reducing the training time by 20% over the best-performing methods.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
