activity
20172021
most citedOn the complexity of finding a local minimizer of a quadratic function over a polytope

18 citations · 42 across the 9 of their papers we have counts for

collaborators

11 papers

cs.RO2021★ 4 cited

Dexterous Manipulation Primitives for the Real Robot Challenge

Claire Chen, Krishnan Srinivasan, Jeffrey Zhang +7

This report describes our approach for Phase 3 of the Real Robot Challenge. To solve cuboid manipulation tasks of varying difficulty, we decompose each task into the following prim…

math.OC2020

Complexity Aspects of Fundamental Questions in Polynomial Optimization

Jeffrey Zhang

In this thesis, we settle the computational complexity of some fundamental questions in polynomial optimization. These include the questions of (i) finding a local minimum, (ii) te…

math.OC2020★ 4 cited

Complexity aspects of local minima and related notions

Amir Ali Ahmadi, Jeffrey Zhang

We consider the notions of (i) critical points, (ii) second-order points, (iii) local minima, and (iv) strict local minima for multivariate polynomials. For each type of point, and…

math.OC2020★ 18 cited

On the complexity of finding a local minimizer of a quadratic function over a polytope

Amir Ali Ahmadi, Jeffrey Zhang

We show that unless P=NP, there cannot be a polynomial-time algorithm that finds a point within Euclidean distance (for any constant ) of a local minimizer of an …

cs.CV2020

Memory-Efficient Incremental Learning Through Feature Adaptation

Ahmet Iscen, Jeffrey Zhang, Svetlana Lazebnik +1

We introduce an approach for incremental learning that preserves feature descriptors of training images from previously learned classes, instead of the images themselves, unlike mo…

cs.CV2019★ 12 cited

Learning to Navigate Using Mid-Level Visual Priors

Alexander Sax, Jeffrey O. Zhang, Bradley Emi +4

How much does having visual priors about the world (e.g. the fact that the world is 3D) assist in learning to perform downstream motor tasks (e.g. navigating a complex environment)…

cs.LG2019

Side-Tuning: A Baseline for Network Adaptation via Additive Side Networks

Jeffrey O Zhang, Alexander Sax, Amir Zamir +2

When training a neural network for a desired task, one may prefer to adapt a pre-trained network rather than starting from randomly initialized weights. Adaptation can be useful in…

cs.AI2018

Modular Architecture for StarCraft II with Deep Reinforcement Learning

Dennis Lee, Haoran Tang, Jeffrey O Zhang +3

We present a novel modular architecture for StarCraft II AI. The architecture splits responsibilities between multiple modules that each control one aspect of the game, such as bui…

cs.LG2018★ 2 cited

Generalized Latent Variable Recovery for Generative Adversarial Networks

Nicholas Egan, Jeffrey Zhang, Kevin Shen

The Generator of a Generative Adversarial Network (GAN) is trained to transform latent vectors drawn from a prior distribution into realistic looking photos. These latent vectors h…

math.OC2018★ 1 cited

On the Complexity of Testing Attainment of the Optimal Value in Nonlinear Optimization

Amir Ali Ahmadi, Jeffrey Zhang

We prove that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can test whether the optimal value of a nonlinear optimization problem wh…

math.OC2017★ 1 cited

Semidefinite Programming and Nash Equilibria in Bimatrix Games

Amir Ali Ahmadi, Jeffrey Zhang

We explore the power of semidefinite programming (SDP) for finding additive -approximate Nash equilibria in bimatrix games. We introduce an SDP relaxation for a quadratic…