Petros Drineas
20 papers · 2005–2025 · 6 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 ↓+10 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (40) π Academic Marathon Β· Ultra π Conference Polyglot Β· Silver π Interdisciplinary Bridge Β· Gold π£ Hot Topic Early Bird
π
Keyword Trendsetter Combo
(4)
π¬
Deep Specialist
(10)
π
Keyword Champion
(2)
π§
Keyword Pioneer
π
Trend Setter
π
Conference Pioneer
ποΈ
Keyword Collector
(95)
π₯
Unstoppable Β· Bronze
π
Century Club Β· Bronze
π
Renaissance Researcher
(6)
Top co-authors
Research topics
Machine Learning
(19)
Mathematics & Optimization
(17)
Optimization
(15)
Optimization & Theory
(15)
Core Methods
(14)
Mathematics
(8)
Learning Types Β· Machine Learning
(4)
Computer Science
(3)
Application Areas
(3)
Foundations
(3)
Data Science & Analytics
(2)
Deep Learning
(2)
Learning Types Β· Deep Learning
(2)
Methods
(2)
Artificial Intelligence
(1)
Keywords
randomized algorithm
(5)
matrix sketching
(5)
randomized linear algebra
(4)
dimensionality reduction
(4)
k-means clustering
(3)
low-rank approximation
(3)
linear programming
(3)
interior point method
(3)
leverage score
(2)
random projection
(2)
approximation guarantee
(2)
feature selection
(2)
approximation algorithm
(2)
matrix factorization
(2)
matrix completion
(2)
nystrom method
(2)
margin maximization
(2)
dimension reduction
(2)
sparse principal component analysis
(2)
conjugate gradient
(2)
Papers
Stacey: Promoting Stochastic Steepest Descent via Accelerated β_p-Smooth Nonconvex Optimization
ICML 2025
Patch2Self2: Self-supervised Denoising on Coresets via Matrix Sketching
CVPR 2024
The Space Complexity of Approximating Logistic Loss
NeurIPS 2024
Refined Mechanism Design for Approximately Structured Priors via Active Regression
NeurIPS 2023
Sketching Algorithms for Sparse Dictionary Learning: PTAS and Turnstile Streaming
NeurIPS 2023
Faster Randomized Interior Point Methods for Tall/Wide Linear Programs
JMLR 2022
On the Convergence of Inexact Predictor-Corrector Methods for Linear Programming
ICML 2022
Faster Randomized Infeasible Interior Point Methods for Tall/Wide Linear Programs
NeurIPS 2020
Randomized Iterative Algorithms for Fisher Discriminant Analysis
UAI 2019
An Iterative, Sketching-based Framework for Ridge Regression
ICML 2018
Recovering PCA and Sparse PCA via Hybrid-(l1,l2) Sparse Sampling of Data Elements
JMLR 2017
Approximating Sparse PCA from Incomplete Data
NeurIPS 2015
Column Selection via Adaptive Sampling
NeurIPS 2015
Feature Selection for Linear SVM with Provable Guarantees
AISTATS 2015
Random Projections for Support Vector Machines
AISTATS 2013
Fast Approximation of Matrix Coherence and Statistical Leverage
JMLR 2012
Sparse Features for PCA-Like Linear Regression
NeurIPS 2011
Random Projections for k-means Clustering
NeurIPS 2010
Unsupervised Feature Selection for the k-means Clustering Problem
NeurIPS 2009
On the Nystrom Method for Approximating a Gram Matrix for Improved Kernel-Based Learning
JMLR 2005