Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via Operator Scaling
暂无分享,去创建一个
[1] Ciprian Demeter,et al. Mean value estimates for Weyl sums in two dimensions , 2015, J. Lond. Math. Soc..
[2] Harm Derksen,et al. Polynomial degree bounds for matrix semi-invariants , 2015, ArXiv.
[3] Prateek Jain,et al. Low-rank matrix completion using alternating minimization , 2012, STOC '13.
[4] C. E. Lemke,et al. Equilibrium Points of Bimatrix Games , 1964 .
[5] Ketan Mulmuley,et al. Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether's Normalization Lemma , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[6] Moritz Hardt,et al. Understanding Alternating Minimization for Matrix Completion , 2013, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[7] Leonid Gurvits,et al. Classical complexity and quantum entanglement , 2004, J. Comput. Syst. Sci..
[8] T. Tao,et al. Finite bounds for Hölder-Brascamp-Lieb multilinear inequalities , 2005, math/0505691.
[9] K. Ball. Volumes of sections of cubes and related problems , 1989 .
[10] Larry Guth,et al. Proof of the main conjecture in Vinogradov's mean value theorem for degrees higher than three , 2015, 1512.01565.
[11] Man-Duen Choi. Completely positive linear maps on complex matrices , 1975 .
[12] Mátyás Domokos,et al. Semi-invariants of quivers as determinants , 2001 .
[13] F. Barthe. On a reverse form of the Brascamp-Lieb inequality , 1997, math/9705210.
[14] Katherine Yelick,et al. On Holder-Brascamp-Lieb inequalities for torsion-free discrete Abelian groups , 2015, 1510.04190.
[15] Alex Samorodnitsky,et al. A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume , 2000, STOC '00.
[16] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[17] E. Lieb. Gaussian kernels have only Gaussian maximizers , 1990 .
[18] Mohit Singh,et al. Maximizing determinants under partition constraints , 2016, STOC.
[19] Avi Wigderson,et al. IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM , 2012, Forum of Mathematics, Sigma.
[20] Richard Sinkhorn. A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices , 1964 .
[21] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[22] David Steurer,et al. Rounding sum-of-squares relaxations , 2013, Electron. Colloquium Comput. Complex..
[23] Ankur Moitra,et al. Algorithms and Hardness for Robust Subspace Recovery , 2012, COLT.
[24] Harm Derksen,et al. The combinatorics of quiver representations , 2006, math/0608288.
[25] Tselil Schramm,et al. Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors , 2015, STOC.
[26] Neal Bez,et al. Behaviour of the Brascamp–Lieb constant , 2016, 1605.08603.
[27] Sergio Verdú,et al. Smoothing Brascamp-Lieb inequalities and strong converses for common randomness generation , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[28] Avi Wigderson,et al. Breaking the quadratic barrier for 3-LCC's over the reals , 2013, STOC.
[29] Avi Wigderson,et al. Fractional Sylvester–Gallai theorems , 2012, Proceedings of the National Academy of Sciences.
[30] Stefanos Zafeiriou,et al. Nonnegative tensor factorization as an alternative Csiszar–Tusnady procedure: algorithms, convergence, probabilistic interpretations and novel probabilistic tensor latent variable analysis algorithms , 2011, Data Mining and Knowledge Discovery.
[31] Zhixian Lei,et al. Sum of Square Proof for Brascamp-Lieb Type Inequality , 2017, ArXiv.
[32] Avi Wigderson,et al. A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing , 2015, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[33] Harm Derksen,et al. Semi-invariants of quivers and saturation for Littlewood-Richardson coefficients , 2000 .
[34] Stefán Ingi Valdimarsson. Geometric Brascamp–Lieb Has the Optimal Best Constant , 2011 .
[35] E. Carlen,et al. Subadditivity of The Entropy and its Relation to Brascamp–Lieb Type Inequalities , 2007, 0710.0870.
[36] Jürgen Forster. A linear lower bound on the unbounded error probabilistic communication complexity , 2002, J. Comput. Syst. Sci..
[37] Neal Bez,et al. Some nonlinear Brascamp–Lieb inequalities and applications to harmonic analysis , 2009, 0906.2064.
[38] David Steurer,et al. Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method , 2014, STOC.
[39] Jonathan Bennett,et al. Stability of the Brascamp-Lieb constant and applications , 2015, 1508.07502.
[40] Stefán Ingi Valdimarsson. The Brascamp–Lieb Polyhedron , 2010, Canadian Journal of Mathematics.
[41] Youming Qiao,et al. Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics , 2015, ArXiv.
[42] E. Lieb,et al. Best Constants in Young's Inequality, Its Converse, and Its Generalization to More than Three Functions , 1976 .
[43] Michel Van den Bergh,et al. Semi-invariants of quivers for arbitrary dimension vectors , 1999 .
[44] Tengyu Ma,et al. Polynomial-Time Tensor Decompositions with Sum-of-Squares , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[45] Alex Samorodnitsky,et al. A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents , 1998, STOC '98.
[46] Ketan Mulmuley,et al. Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems , 2002, SIAM J. Comput..
[47] T. Tao,et al. The Brascamp–Lieb Inequalities: Finiteness, Structure and Extremals , 2005, math/0505065.