Results 21 to 30 of about 71,380 (295)
Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation [PDF]
We give the first rigorous proof of the convergence of Riemannian Hamiltonian Monte Carlo, a general (and practical) method for sampling Gibbs distributions.
Y. Lee, S. Vempala
semanticscholar +1 more source
Robustness of Magic and Symmetries of the Stabiliser Polytope [PDF]
We give a new algorithm for computing therobustness of magic- a measure of the utility of quantum states as a computational resource. Our work is motivated by themagic state modelof fault-tolerant quantum computation.
Markus Heinrich, D. Gross
semanticscholar +1 more source
On expected number of maximal points in polytopes [PDF]
We answer an old question: what are possible growth rates of the expected number of vector-maximal points in a uniform sample from a polytope.
Yu. Baryshnikov
doaj +1 more source
The Relationship between the Stasheff Polytope and Painted Trees Using Tubings [PDF]
A polytope plays a central role in different areas of mathematics. It is used quite heavily in applied fields of mathematics, such as medical imaging and robotics, geometric modeling. A polytope has many users in modern science such as computer graphics,
Shatha Asaad Salman +2 more
doaj +1 more source
Flag enumerations of matroid base polytopes [PDF]
In this paper, we study flag structures of matroid base polytopes. We describe faces of matroid base polytopes in terms of matroid data, and give conditions for hyperplane splits of matroid base polytopes.
Sangwook Kim
doaj +1 more source
Newton polytope of good symmetric polynomials
We introduce a general class of symmetric polynomials that have saturated Newton polytope and their Newton polytope has integer decomposition property. The class covers numerous previously studied symmetric polynomials.
Nguyen, Duc-Khanh +3 more
doaj +1 more source
Polytope Conditioning and Linear Convergence of the Frank-Wolfe Algorithm [PDF]
It is known that the gradient descent algorithm converges linearly when applied to a strongly convex function with Lipschitz gradient. In this case the algorithm's rate of convergence is determined by the condition number of the function.
Javier F. Peña, Daniel Rodríguez
semanticscholar +1 more source
Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices [PDF]
This paper considers compressed sensing and affine rank minimization in both noiseless and noisy cases and establishes sharp restricted isometry conditions for sparse signal and low-rank matrix recovery. The analysis relies on a key technical tool, which
Tommaso Cai, Anru R. Zhang
semanticscholar +1 more source
Computing The Number of Integral Points in4-dimensional Ball Using Tutte Polynomial [PDF]
In recent years, the uses of high dimensional appear in a large and a lot of applications appearwithin it. So, we study these applications and take one of them that play a central role in the factoring of prime number which is an application especially ...
Shatha Assaad Salman Al-Najjar
doaj +1 more source
Polytope Novikov homology [PDF]
AbstractLet M be a closed manifold and $${\mathcal {A}} \subseteq H^1_{\mathrm {dR}}(M)$$ A ⊆ H dR 1 ( M
openaire +5 more sources

