Skip to content
conftrace_

Javad Lavaei

29 papers · 2018–2026 · 7 venues · across top CS/AI venues

Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.

Achievements

Jump to papers ↓
+12 more ↓ πŸ—ΊοΈ Taxonomy Completionist (40) 🌍 Conference Polyglot Β· Silver πŸƒ Academic Marathon Β· Sprint πŸŒ‰ Interdisciplinary Bridge Β· Silver 🐣 Hot Topic Early Bird
πŸ”¬ Deep Specialist (17) πŸ† Grand Slam 🧬 Topic Evolution πŸ‘‘ Triple Crown πŸ† Keyword Champion (7) 🀝 Dynamic Duo (11) ⚑ Prolific Year Β· Prolific πŸ”₯ Unstoppable Β· Bronze ❓ The Questioner πŸ’Ž Century Club Β· Bronze πŸš€ Conference Pioneer πŸ—ƒοΈ Keyword Collector (129)

Venues

NeurIPS (9) AAAI (7) AISTATS (5) L4DC (3) ICML (2) JMLR (2) ICLR (1)

Top co-authors

Somayeh Sojoudi (11) Yuhao Ding (9) Ming Jin (6) Haixiang Zhang (5) Ziye Ma (5) Donghao Ying (4) Yingjie Bi (4) Igor Molybog (3) Baturalp Yalçın (2) Ying Chen (2)

Research topics

Machine Learning (25) Optimization & Theory Β· Machine Learning (21) Mathematics & Optimization (16) Optimization (16) Reinforcement Learning (10) Methods (10) Learning Types (7) Deep Learning (5) Mathematics (5) Artificial Intelligence (4) Core Methods (4) Core AI (3) Optimization & Theory Β· Deep Learning (3) Applications (2) Learning Paradigms (2)

Keywords

restricted isometry property (7) non-convex optimization (6) matrix completion (5) constrained markov decision process (4) dynamic regret (4) gradient descent (4) matrix sensing (4) strict saddle property (3) policy optimization (3) burer-monteiro factorization (3) low-rank matrix (3) non-stationary environment (3) safe reinforcement learning (3) spurious local minima (3) primal-dual optimization (3) low-rank matrix recovery (3) semidefinite programming (3) low-rank optimization (3) global convergence (2) policy gradient (2)

Papers

Subgradient Method for System Identification with Non-Smooth Objectives L4DC 2026 A Dynamic Penalization Framework for Online Rank-1 Semidefinite Programming Relaxations L4DC 2025 Absence of spurious solutions far from ground truth: A low-rank analysis with high-order losses AISTATS 2024 Pausing Policy Learning in Non-stationary Reinforcement Learning ICML 2024 A CMDP-within-online framework for Meta-Safe Reinforcement Learning ICLR 2023 Algorithmic Regularization in Tensor Optimization: Towards a Lifted Approach in Matrix Sensing NeurIPS 2023 Geometric Analysis of Matrix Sensing over Graphs NeurIPS 2023 Learning-to-Learn to Guide Random Search: Derivative-Free Meta Blackbox Optimization on Manifold L4DC 2023 Non-stationary Risk-Sensitive Reinforcement Learning: Near-Optimal Dynamic Regret, Adaptive Detection, and Separation Design AAAI 2023 No-Regret Learning in Dynamic Competition with Reference Effects Under Logit Demand NeurIPS 2023 Over-parametrization via Lifting for Low-rank Matrix Sensing: Conversion of Spurious Solutions to Strict Saddle Points ICML 2023 Policy-Based Primal-Dual Methods for Convex Constrained Markov Decision Processes AAAI 2023 Provably Efficient Primal-Dual Reinforcement Learning for CMDPs with Non-stationary Objectives and Constraints AAAI 2023 Scalable Primal-Dual Actor-Critic Method for Safe Multi-Agent RL with General Utilities NeurIPS 2023 Semidefinite Programming versus Burer-Monteiro Factorization for Matrix Sensing AAAI 2023 Tempo Adaptation in Non-stationary Reinforcement Learning NeurIPS 2023 A Dual Approach to Constrained Markov Decision Processes with Entropy Regularization AISTATS 2022 Factorization Approach for Low-complexity Matrix Completion Problems: Exponential Number of Spurious Solutions and Failure of Gradient Methods AISTATS 2022 Local and Global Linear Convergence of General Low-Rank Matrix Recovery Problems AAAI 2022 On the Global Optimum Convergence of Momentum-based Policy Gradient AISTATS 2022 Sharp Restricted Isometry Property Bounds for Low-Rank Matrix Recovery Problems with Corrupted Measurements AAAI 2022 General Low-rank Matrix Optimization: Geometric Analysis and Sharper Bounds NeurIPS 2021 On the Absence of Spurious Local Minima in Nonlinear Low-Rank Matrix Recovery Problems AISTATS 2021 Stochastic $L^\natural$-convex Function Minimization NeurIPS 2021 Conic Optimization for Quadratic Regression Under Sparse Noise JMLR 2020 On Sampling Complexity of the Semidefinite Affine Rank Feasibility Problem AAAI 2019 Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery JMLR 2019 A theory on the absence of spurious solutions for nonconvex and nonsmooth optimization NeurIPS 2018 How Much Restricted Isometry is Needed In Nonconvex Matrix Recovery? NeurIPS 2018