Skip to content
conftrace_

Somayeh Sojoudi

29 papers · 2016–2025 · 8 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.

Jump to papers ↓
+9 more ↓ πŸ—ΊοΈ Taxonomy Completionist (49) πŸƒ Academic Marathon Β· Sprint 🌍 Conference Polyglot Β· Silver πŸŒ‰ Interdisciplinary Bridge Β· Silver 🐣 Hot Topic Early Bird
🀝 Dynamic Duo (11) πŸ† Keyword Champion (3) πŸ”¬ Deep Specialist (13) 🌈 Renaissance Researcher (7) πŸ”₯ Unstoppable Β· Bronze ❓ The Questioner ⚑ Prolific Year Β· Productive πŸ’Ž Century Club Β· Bronze πŸ—ƒοΈ Keyword Collector (131)

Papers

Towards Optimal Branching of Linear and Semidefinite Relaxations for Neural Network Robustness Certification JMLR 2025 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 Mixing classifiers to alleviate the accuracy-robustness trade-off L4DC 2024 Pausing Policy Learning in Non-stationary Reinforcement Learning ICML 2024 Ranking Manipulation for Conversational Search Engines EMNLP 2024 Soft convex quantization: revisiting Vector Quantization with convex optimization L4DC 2024 Transport of Algebraic Structure to Latent Embeddings ICML 2024 Algorithmic Regularization in Tensor Optimization: Towards a Lifted Approach in Matrix Sensing NeurIPS 2023 Asymmetric Certified Robustness via Feature-Convex Neural Networks NeurIPS 2023 Noisy Low-rank Matrix Optimization: Geometry of Local Minima and Convergence Rate AISTATS 2023 Over-parametrization via Lifting for Low-rank Matrix Sensing: Conversion of Spurious Solutions to Strict Saddle Points ICML 2023 Semidefinite Programming versus Burer-Monteiro Factorization for Matrix Sensing AAAI 2023 Tempo Adaptation in Non-stationary Reinforcement Learning NeurIPS 2023 Certified Robustness via Locally Biased Randomized Smoothing L4DC 2022 Factorization Approach for Low-complexity Matrix Completion Problems: Exponential Number of Spurious Solutions and Failure of Gradient Methods AISTATS 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 Graph Neural Networks for Distributed Linear-Quadratic Control L4DC 2021 Improving Fairness and Privacy in Selection Problems AAAI 2021 Power up! Robust Graph Convolutional Network via Graph Powering AAAI 2021 Exact Guarantees on the Absence of Spurious Local Minima for Non-negative Rank-1 Robust Principal Component Analysis JMLR 2020 Implicit Graph Neural Networks NeurIPS 2020 Graphical Lasso and Thresholding: Equivalence and Closed-form Solutions JMLR 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 Large-Scale Sparse Inverse Covariance Estimation via Thresholding and Max-Det Matrix Completion ICML 2018 Equivalence of Graphical Lasso and Thresholding for Sparse Graphs JMLR 2016