Panagiotis Patrinos
11 papers · 2020–2025 · 6 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+4 more ↓ Show less ↑
🏃 Academic Marathon (5) 🐝 Cross-Pollinator (10) 🗺️ Taxonomy Completionist (13) 🧭 Keyword Pioneer 🌉 Interdisciplinary Bridge
🌍
Conference Polyglot
(6)
💎
Century Club
(11)
🚀
Conference Pioneer
⚡
Prolific Year
(5)
Conferences
ICML (5)
L4DC (2)
AAAI (1)
AISTATS (1)
ECCV (1)
ICLR (1)
Top co-authors
Keywords
dimensionality reduction
(1)
non-convex optimization
(1)
semidefinite programming
(1)
matrix factorization
(1)
kernel principal component analysis
(1)
kernel pca
(1)
gradient descent
(1)
sparse optimization
(1)
alternating minimization
(1)
linear quadratic regulator
(1)
block coordinate descent
(1)
proximal gradient
(1)
distributionally robust optimization
(1)
feature mapping
(1)
convergence guarantee
(1)
non-smooth optimization
(1)
robust control
(1)
moreau envelope
(1)
first order method
(1)
adaptive method
(1)
Papers
Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
AISTATS 2025
Nonlinearly Preconditioned Gradient Methods under Generalized Smoothness
ICML 2025
Unsupervised Neighborhood Propagation Kernel Layers for Semi-supervised Node Classification
AAAI 2024
Convex Relaxations for Manifold-Valued Markov Random Fields with Approximation Guarantees
ECCV 2024
Adaptive Proximal Gradient Methods Are Universal Without Approximation
ICML 2024
Learning in Feature Spaces via Coupled Covariances: Asymmetric Kernel SVD and Nyström method
ICML 2024
On the convergence of adaptive first order methods: Proximal gradient and alternating minimization algorithms
L4DC 2024
Extending Kernel PCA through Dualization: Sparsity, Robustness and Fast Algorithms
ICML 2023
Solving stochastic weak Minty variational inequalities without increasing batch size
ICLR 2023
Data-driven distributionally robust LQR with multiplicative noise
L4DC 2020
Inertial Block Proximal Methods for Non-Convex Non-Smooth Optimization
ICML 2020