Related papers: Generalization of the Ball-Collision Algorithm

In this paper we propose a distributed version of a randomized block-coordinate descent method for minimizing the sum of a partially separable smooth convex function and a fully separable non-smooth convex function. Under the assumption of…

Complex data usually results from the interaction of objects produced by different generating mechanisms. Here we introduce a universal, unsupervised and parameter-free model-oriented approach, based upon the seminal concept of algorithmic…

The objectives of this technical report is to provide additional results on the generalized conditional gradient methods introduced by Bredies et al. [BLM05]. Indeed , when the objective function is smooth, we provide a novel certificate of…

We give a generalization of the random matrix ensembles, including all lassical ensembles. Then we derive the joint density function of the generalized ensemble by one simple formula, which give a direct and unified way to compute the…

This paper demonstrates the use of entanglement resources in quantum speedup by presenting an algorithm which is the generalization of an algorithm proposed by Goswami and Panigrahi [arXiv:1706.09489 (2017)]. We generalize the algorithm and…

We present a new PAC-Bayesian generalization bound. Standard bounds contain a $\sqrt{L_n \cdot \KL/n}$ complexity term which dominates unless $L_n$, the empirical error of the learning algorithm's randomized predictions, vanishes. We manage…

The interactions which preserve the structure of the gauge interactions of the free theory are introduced in terms of the generalized fields method of solving the Batalin-Vilkovisky master equation. It is shown that by virtue of this method…

This paper combines the post-Minkowskian expansion of general relativity with the language of intersection theory. Because of the nature of the soft limit inherent to the post-Minkowskian expansion, the intersection-based approach is of…

Generalized trigonometric functions are applied to the Legendre-Jacobi standard form of complete elliptic integrals, and a new form of the generalized complete elliptic integrals of the Borweins is presented. According to the form, it can…

We consider a special case of the generalized P\'{o}lya's urn model introduced by Benaim et al (2013). Given a finite connected graph $G$, place a bin at each vertex. Two bins are called a pair if they share an edge of $G$. At discrete…

A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…

An exact, number-conserving solution to the generalized, orbit-dependent pairing problem is derived by introducing an infinite-dimensional algebra. A method for obtaining eigenvalues and eigenvectors of the corresponding Hamiltonian is also…

Most recent CNN architectures use average pooling as a final feature encoding step. In the field of fine-grained recognition, however, recent global representations like bilinear pooling offer improved performance. In this paper, we…

In this paper, we present a generalisation of the Phase Kick-Back technique, which is central to some of the classical algorithms in quantum computing, such as the Deutsch--Jozsa algorithm, Simon's algorithm or Grover's algorithm. We will…

We introduce generalised orbit algebras. The purpose here is to measure how some combinatorial properties can characterize the action of a group of permutations on the subsets. The similarity with orbit algebras is such that it took the…

We examine three different algorithms that enable the collision certificate method from [Bialkowski, et al.] to handle the case of a centralized multi-robot team. By taking advantage of symmetries in the configuration space of multi-robot…

According to the classification scheme of the generalized random matrix ensembles, we present various kinds of concrete examples of the generalized ensemble, and derive their joint density functions in an unified way by one simple formula…

This paper describes perturbative framework, on the basis of the closed-time-path formalism, in terms of quasiparticle picture for studying quasiuniform relativistic quantum field systems near equilibrium and nonequilibrium quasistationary…

We prove a generalization to the context of real geometry of an intersection formula for the vanishing cycle functor, which in the complex context is due to Dubson, Ginsburg, Le and Sabbah (after a conjecture of Deligne). It is also a…

The rigorous approach aimed at providing exact analytical results for hybrid classical-quantum models is elaborated on the grounds of generalized algebraic mapping transformations. This conceptually simple method allows one to obtain novel…