activity
20102026
most citedOn the Degrees of Freedom Achievable Through Interference Alignment in a MIMO Interference Channel

265 citations · 1k across the 84 of their papers we have counts for

collaborators
Showing 2019Show all

7 papers · 1 filter

cs.LG2019★ 8 cited

When Does Non-Orthogonal Tensor Decomposition Have No Spurious Local Minima?

Maziar Sanjabi, Sina Baharlouei, Meisam Razaviyayn +1

We study the optimization problem for decomposing dimensional fourth-order Tensors with non-orthogonal components. We derive \textit{deterministic} conditions under which s…

math.OC2019★ 5 cited

SNAP: Finding Approximate Second-Order Stationary Solutions Efficiently for Non-convex Linearly Constrained Problems

Songtao Lu, Meisam Razaviyayn, Bo Yang +2

This paper proposes low-complexity algorithms for finding approximate second-order stationary points (SOSPs) of problems with smooth non-convex objective and linear constraints. Wh…

cs.LG2019★ 14 cited

Rényi Fair Inference

Sina Baharlouei, Maher Nouiehed, Ahmad Beirami +1

Machine learning algorithms have been increasingly deployed in critical automated decision-making systems that directly affect human lives. When these algorithms are only trained t…

math.OC2019

Robustness of accelerated first-order algorithms for strongly convex optimization problems

Hesameddin Mohammadi, Meisam Razaviyayn, Mihailo R. Jovanović

We study the robustness of accelerated first-order algorithms to stochastic uncertainties in gradient evaluation. Specifically, for unconstrained, smooth, strongly convex optimizat…

cs.LG2019

Training generative networks using random discriminators

Babak Barazandeh, Meisam Razaviyayn, Maziar Sanjabi

In recent years, Generative Adversarial Networks (GANs) have drawn a lot of attentions for learning the underlying distribution of data in various applications. Despite their wide…

math.OC2019

A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Non-Convex Optimization

Maher Nouiehed, Meisam Razaviyayn

Motivated by TRACE algorithm [Curtis et al. 2017], we propose a trust region algorithm for finding second order stationary points of a linearly constrained non-convex optimization…

math.OC2019★ 138 cited

Solving a Class of Non-Convex Min-Max Games Using Iterative First Order Methods

Maher Nouiehed, Maziar Sanjabi, Tianjian Huang +2

Recent applications that arise in machine learning have surged significant interest in solving min-max saddle point games. This problem has been extensively studied in the convex-c…