Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Ghosh, Mrinalkanti"'
Autor:
Ghosh, Mrinalkanti, Jeronimo, Fernando Granha, Jones, Chris, Potechin, Aaron, Rajendran, Goutham
The Sum-of-Squares (SoS) hierarchy is a semi-definite programming meta-algorithm that captures state-of-the-art polynomial time guarantees for many optimization problems such as Max-$k$-CSPs and Tensor PCA. On the flip side, a SoS lower bound provide
Externí odkaz:
http://arxiv.org/abs/2009.01874
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Bhattiprolu, Vijay, Ghosh, Mrinalkanti, Guruswami, Venkatesan, Lee, Euiwoong, Tulsiani, Madhur
We consider the $(\ell_p,\ell_r)$-Grothendieck problem, which seeks to maximize the bilinear form $y^T A x$ for an input matrix $A$ over vectors $x,y$ with $\|x\|_p=\|y\|_r=1$. The problem is equivalent to computing the $p \to r^*$ operator norm of $
Externí odkaz:
http://arxiv.org/abs/1804.03644
Autor:
Bhattiprolu, Vijay, Ghosh, Mrinalkanti, Guruswami, Venkatesan, Lee, Euiwoong, Tulsiani, Madhur
We study the problem of computing the $p\rightarrow q$ norm of a matrix $A \in R^{m \times n}$, defined as \[ \|A\|_{p\rightarrow q} ~:=~ \max_{x \,\in\, R^n \setminus \{0\}} \frac{\|Ax\|_q}{\|x\|_p} \] This problem generalizes the spectral norm of a
Externí odkaz:
http://arxiv.org/abs/1802.07425
Autor:
Bhattiprolu, Vijay, Ghosh, Mrinalkanti, Guruswami, Venkatesan, Lee, Euiwoong, Tulsiani, Madhur
We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem arises in div
Externí odkaz:
http://arxiv.org/abs/1611.05998
Autor:
Ghosh, Mrinalkanti, Tulsiani, Madhur
We study the approximability of constraint satisfaction problems (CSPs) by linear programming (LP) relaxations. We show that for every CSP, the approximation obtained by a basic LP relaxation, is no weaker than the approximation obtained using relaxa
Externí odkaz:
http://arxiv.org/abs/1608.00497
In 1970, Donald Ornstein proved a landmark result in dynamical systems, viz., two Bernoulli systems with the same entropy are isomorphic except for a measure 0 set. Keane and Smorodinsky gave a finitary proof of this result. They also indicated how o
Externí odkaz:
http://arxiv.org/abs/1404.0766
In the online prediction framework, we use generalized entropy of to study the loss rate of predictors when outcomes are drawn according to stationary ergodic distributions over the binary alphabet. We show that the notion of generalized entropy of a
Externí odkaz:
http://arxiv.org/abs/1205.2996
Autor:
Das, Kamalesh, Ghosh, Mrinalkanti, Khanna, Bidisha, Banerjee, Mausumi, Mondal, G.P., Singh, Om Prakash, Chakraborty, Arindam
Publikováno v:
In Clinical Neurology and Neurosurgery 2010 112(9):766-769
Autor:
Ghosh, Ritwik, De, Kaustav, Roy, Devlina, Mandal, Arpan, Biswas, Subrata, Biswas, Subhrajyoti, Sengupta, Swagatam, Naga, Dinabandhu, Ghosh, Mrinalkanti, Benito-León, Julián
Publikováno v:
In Journal of Neuroimmunology 15 January 2021 350