Related papers: Collisions between kinks with long-range tails: a …
Efficient Bayesian inference remains a computational challenge in hierarchical models. Simulation-based approaches such as Markov Chain Monte Carlo methods are still popular but have a large computational cost. When dealing with the large…
Deploying deep models in real-world scenarios entails a number of challenges, including computational efficiency and real-world (e.g., long-tailed) data distributions. We address the combined challenge of learning long-tailed distributions…
Real-world data is extremely imbalanced and presents a long-tailed distribution, resulting in models that are biased towards classes with sufficient samples and perform poorly on rare classes. Recent methods propose to rebalance classes but…
We formulate as an inverse problem the construction of sparse parametric continuous curve models that fit a sequence of contour points. Our prior is incorporated as a regularization term that encourages rotation invariance and sparsity. We…
Error-mitigation methods for Ising machines are reexamined not merely as noise-suppression techniques but as a structural design problem of replica-coupled Ising models. Using simulated annealing as a hardware-noise-free testbed, we…
We fully generalize a previously-developed computational geometry tool [1] to perform large-scale simulations of arbitrary two-dimensional faceted surfaces $z = h(x,y)$. Our method uses a three-component facet/edge/junction storage model,…
We consider non-convex stochastic optimization using first-order algorithms for which the gradient estimates may have heavy tails. We show that a combination of gradient clipping, momentum, and normalized gradient descent yields convergence…
In this paper we examine the scattering processes among the members of a rich family of kinks which arise in a (1+1)-dimensional relativistic two scalar field theory. These kinks carry two different topological charges that determine the…
Whereas the short time behaviour of an unstable quantum mechanical system is well understood from its theoretical as well as experimental side, the long time tail of the very same systems has neither been measured experimentally nor is…
Bayesian inference is useful to obtain a predictive distribution with a small generalization error. However, since posterior distributions are rarely evaluated analytically, we employ the variational Bayesian inference or sampling method to…
This study develops a Lagged Backward-Compatible Physics-Informed Neural Network (LBC-PINN) for simulating and inverting one-dimensional unsaturated soil consolidation under long-term loading. To address the challenges of coupled air and…
In astronomical observations, the estimation of distances from parallaxes is a challenging task due to the inherent measurement errors and the non-linear relationship between the parallax and the distance. This study leverages ideas from…
Branch-and-bound algorithms (B&B) and polynomial-time approximation schemes (PTAS) are two seemingly distant areas of combinatorial optimization. We intend to (partially) bridge the gap between them while expanding the boundary of…
We propose a novel method for fitting planar B-spline curves to unorganized data points. In traditional methods, optimization of control points and foot points are performed in two very time-consuming steps in each iteration: 1) control…
In a recent paper, we studied the scalar fields of the five dimensional N=2 hypermultiplets using the method of symplectic covariance. For static spherically symmetric backgrounds, we showed that exactly two possibilities exist and detailed…
We propose a simplified procedure for the experimental application of the efficiency correction on higher order cumulants in heavy-ion collisions. By using the track-by-track efficiency, we can eliminate possible bias arising from the…
We propose a way to solve BCS-type pairing model by to exactly solve its spin-analogy in the subspace. The advantages of our method are to avoid to directly deal with the approximate procedure and to transfer an exponentially complicated…
A fundamental challenge in Bayesian inference is efficient representation of a target distribution. Many non-parametric approaches do so by sampling a large number of points using variants of Markov Chain Monte Carlo (MCMC). We propose an…
Sum-product networks (SPNs) are probabilistic models characterized by exact and fast evaluation of fundamental probabilistic operations. Its superior computational tractability has led to applications in many fields, such as machine…
Generalized Burridge-Knopoff (GBK) models display rich dynamics, characterized by instabilities and multiple bifurcations. GBK models consist of interconnected masses that can slide on a rough surface under friction. All masses are…