Somayeh Sojoudi
29 papers · 2016–2025 · 8 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+11 more ↓ Show less ↑
🏃 Academic Marathon (9) 🌍 Conference Polyglot (8) 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🐣 Hot Topic Early Bird
🌉
Interdisciplinary Bridge
🌍
Conference Polyglot
(8)
🏃
Academic Marathon
(9)
🔬
Deep Specialist
(13)
🤝
Dynamic Duo
(11)
🏆
Keyword Champion
(3)
🗃️
Keyword Collector
(121)
❓
The Questioner
⚡
Prolific Year
(6)
💎
Century Club
(29)
🔥
Unstoppable
(8)
Conferences
NIPS (6)
JMLR (5)
L4DC (5)
AAAI (4)
ICML (4)
AISTATS (3)
EMNLP (1)
INTERSPEECH (1)
Top co-authors
Research topics
Keywords
restricted isometry property
(4)
adversarial robustness
(4)
non-convex optimization
(4)
matrix sensing
(4)
spurious local minima
(4)
graph neural network
(3)
burer-monteiro factorization
(3)
certified robustness
(3)
graphical lasso
(3)
matrix completion
(3)
gradient descent
(3)
nonconvex optimization
(3)
spurious solution
(2)
critical point
(2)
matrix recovery
(2)
semidefinite programming
(2)
low-rank matrix
(2)
sparse inverse covariance
(2)
low-rank optimization
(2)
landscape analysis
(2)
Papers
Towards Optimal Branching of Linear and Semidefinite Relaxations for Neural Network Robustness Certification
JMLR 2025
Pausing Policy Learning in Non-stationary Reinforcement Learning
ICML 2024
Transport of Algebraic Structure to Latent Embeddings
ICML 2024
Ranking Manipulation for Conversational Search Engines
EMNLP 2024
Mixing classifiers to alleviate the accuracy-robustness trade-off
L4DC 2024
Soft convex quantization: revisiting Vector Quantization with convex optimization
L4DC 2024
Absence of spurious solutions far from ground truth: A low-rank analysis with high-order losses
AISTATS 2024
ConsistencyTTA: Accelerating Diffusion-Based Text-to-Audio Generation with Consistency Distillation
INTERSPEECH 2024
Noisy Low-rank Matrix Optimization: Geometry of Local Minima and Convergence Rate
AISTATS 2023
Semidefinite Programming versus Burer-Monteiro Factorization for Matrix Sensing
AAAI 2023
Algorithmic Regularization in Tensor Optimization: Towards a Lifted Approach in Matrix Sensing
NIPS 2023
Asymmetric Certified Robustness via Feature-Convex Neural Networks
NIPS 2023
Over-parametrization via Lifting for Low-rank Matrix Sensing: Conversion of Spurious Solutions to Strict Saddle Points
ICML 2023
Tempo Adaptation in Non-stationary Reinforcement Learning
NIPS 2023
Certified Robustness via Locally Biased Randomized Smoothing
L4DC 2022
Safe Reinforcement Learning with Chance-constrained Model Predictive Control
L4DC 2022
Sharp Restricted Isometry Property Bounds for Low-Rank Matrix Recovery Problems with Corrupted Measurements
AAAI 2022
Factorization Approach for Low-complexity Matrix Completion Problems: Exponential Number of Spurious Solutions and Failure of Gradient Methods
AISTATS 2022
Power up! Robust Graph Convolutional Network via Graph Powering
AAAI 2021
Graph Neural Networks for Distributed Linear-Quadratic Control
L4DC 2021
Improving Fairness and Privacy in Selection Problems
AAAI 2021
Implicit Graph Neural Networks
NIPS 2020
Exact Guarantees on the Absence of Spurious Local Minima for Non-negative Rank-1 Robust Principal Component Analysis
JMLR 2020
Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery
JMLR 2019
Graphical Lasso and Thresholding: Equivalence and Closed-form Solutions
JMLR 2019
Large-Scale Sparse Inverse Covariance Estimation via Thresholding and Max-Det Matrix Completion
ICML 2018
How Much Restricted Isometry is Needed In Nonconvex Matrix Recovery?
NIPS 2018
A theory on the absence of spurious solutions for nonconvex and nonsmooth optimization
NIPS 2018
Equivalence of Graphical Lasso and Thresholding for Sparse Graphs
JMLR 2016