Anastasios Kyrillidis

Affiliations:
  • University of Texas at Austin, Department of Electrical and Computer Engineering, USA
  • Swiss Federal Institute of Technology in Lausanne, Switzerland


According to our database1, Anastasios Kyrillidis authored at least 113 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
GIST: distributed training for large-scale graph convolutional networks.
J. Appl. Comput. Topol., October, 2024

Better schedules for low precision training of deep neural networks.
Mach. Learn., June, 2024

How Much Pre-training Is Enough to Discover a Good Subnetwork?
Trans. Mach. Learn. Res., 2024

When is Momentum Extragradient Optimal? A Polynomial-Based Analysis.
Trans. Mach. Learn. Res., 2024

A Catalyst Framework for the Quantum Linear System Problem via the Proximal Point Algorithm.
CoRR, 2024

Fast FixMatch: Faster Semi-Supervised Learning with Curriculum Batch Size.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Stochastic Implicit Neural Signed Distance Functions for Safe Motion Planning under Sensing Uncertainty.
Proceedings of the IEEE International Conference on Robotics and Automation, 2024

On the Error-Propagation of Inexact Hotelling's Deflation for Principal Component Analysis.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Adaptive Federated Learning with Auto-Tuned Clients.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Provable Accelerated Convergence of Nesterov's Momentum for Deep ReLU Neural Networks.
Proceedings of the International Conference on Algorithmic Learning Theory, 2024

2023
Local Stochastic Factored Gradient Descent for Distributed Quantum State Tomography.
IEEE Control. Syst. Lett., 2023

On the Error-Propagation of Inexact Deflation for Principal Component Analysis.
CoRR, 2023

CrysFormer: Protein Structure Prediction via 3d Patterson Maps and Partial Structure Attention.
CoRR, 2023

Sweeping Heterogeneity with Smart MoPs: Mixture of Prompts for LLM Task Adaptation.
CoRR, 2023

Fed-ZERO: Efficient Zero-shot Personalization with Federated Mixture of Experts.
CoRR, 2023

Accelerated Convergence of Nesterov's Momentum for Deep Neural Networks under Partial Strong Convexity.
CoRR, 2023

Scissorhands: Exploiting the Persistence of Importance Hypothesis for LLM KV Cache Compression at Test Time.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Using non-convex optimization in quantum process tomography: Factored gradient descent is tough to beat.
Proceedings of the IEEE International Conference on Rebooting Computing, 2023

Optimal Grasps and Placements for Task and Motion Planning in Clutter.
Proceedings of the IEEE International Conference on Robotics and Automation, 2023

Federated Learning Over Images: Vertical Decompositions and Pre-Trained Backbones Are Difficult to Beat.
Proceedings of the IEEE/CVF International Conference on Computer Vision, 2023

Strong Lottery Ticket Hypothesis with ε-perturbation.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

LOFT: Finding Lottery Tickets through Filter-wise Training.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

Efficient and Light-Weight Federated Learning via Asynchronous Distributed Dropout.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
On the Convergence of Shallow Neural Network Training with Randomly Masked Neurons.
Trans. Mach. Learn. Res., 2022

Distributed Learning of Fully Connected Neural Networks using Independent Subnet Training.
Proc. VLDB Endow., 2022

Extragradient with Positive Momentum is Optimal for Games with Cross-Shaped Jacobian Spectrum.
CoRR, 2022

Cold Start Streaming Learning for Deep Networks.
CoRR, 2022

DPMS: An ADD-Based Symbolic Approach for Generalized MaxSAT Solving.
CoRR, 2022

ResIST: Layer-wise decomposition of ResNets for distributed training.
Proceedings of the Uncertainty in Artificial Intelligence, 2022

Stackmix: a complementary mix algorithm.
Proceedings of the Uncertainty in Artificial Intelligence, 2022

REX: Revisiting Budgeted Training with an Improved Schedule.
Proceedings of the Fifth Conference on Machine Learning and Systems, 2022

i-SpaSP: Structured Neural Pruning via Sparse Signal Recovery.
Proceedings of the Learning for Dynamics and Control Conference, 2022

Convergence and Stability of the Stochastic Proximal Point Algorithm with Momentum.
Proceedings of the Learning for Dynamics and Control Conference, 2022

PipeGCN: Efficient Full-Graph Training of Graph Convolutional Networks with Pipelined Feature Communication.
Proceedings of the Tenth International Conference on Learning Representations, 2022

No More Than 6ft Apart: Robust K-Means via Radius Upper Bounds.
Proceedings of the IEEE International Conference on Acoustics, 2022

Demon: Improved Neural Network Training With Momentum Decay.
Proceedings of the IEEE International Conference on Acoustics, 2022

2021
Federated Multiple Label Hashing (FedMLH): Communication Efficient Federated Learning on Extreme Classification Tasks.
CoRR, 2021

Provably Efficient Lottery Ticket Discovery.
CoRR, 2021

Momentum-inspired Low-Rank Coordinate Descent for Diagonally Constrained SDPs.
CoRR, 2021

Fast quantum state reconstruction via accelerated non-convex programming.
CoRR, 2021

GIST: Distributed Training for Large-Scale Graph Convolutional Networks.
CoRR, 2021

Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions.
Artif. Intell., 2021

Robust Optimization-based Motion Planning for high-DOF Robots under Sensing Uncertainty.
Proceedings of the IEEE International Conference on Robotics and Automation, 2021

Mitigating Deep Double Descent by Concatenating Inputs.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

Bayesian Coresets: Revisiting the Nonconvex Optimization Perspective.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

On Continuous Local BDD-Based Search for Hybrid SAT Solving.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Rank-One Measurements of Low-Rank PSD Matrices Have Small Feasible Sets.
CoRR, 2020

On Generalization of Adaptive Methods for Over-parameterized Linear Regression.
CoRR, 2020

ImCLR: Implicit Contrastive Learning for Image Classification.
CoRR, 2020

Bayesian Coresets: An Optimization Perspective.
CoRR, 2020

Negative Sampling in Semi-Supervised learning.
Proceedings of the 37th International Conference on Machine Learning, 2020

Low-rank regularization and solution uniqueness in over-parameterized matrix sensing.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Optimal Mini-Batch Size Selection for Fast Gradient Descent.
CoRR, 2019

Decaying momentum helps neural network training.
CoRR, 2019

Distributed Learning of Deep Neural Networks using Independent Subnet Training.
CoRR, 2019

SysML: The New Frontier of Machine Learning Systems.
CoRR, 2019

Learning Sparse Distributions using Iterative Hard Thresholding.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Compressing Gradient Optimizers via Count-Sketches.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
A Non-Euclidean Gradient Descent Framework for Non-Convex Matrix Factorization.
IEEE Trans. Signal Process., 2018

Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably.
SIAM J. Imaging Sci., 2018

A Single-Phase, Proximal Path-Following Framework.
Math. Oper. Res., 2018

Implicit regularization and solution uniqueness in over-parameterized matrix sensing.
CoRR, 2018

Run Procrustes, Run! On the convergence of accelerated Procrustes Flow.
CoRR, 2018

Approximate Newton-based statistical inference using only stochastic gradients.
CoRR, 2018

Simple and practical algorithms for 𝓁<sub>p</sub>-norm low-rank approximation.
Proceedings of the Thirty-Fourth Conference on Uncertainty in Artificial Intelligence, 2018

IHT dies hard: Provable accelerated Iterative Hard Thresholding.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

Statistical Inference Using SGD.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Provable quantum state tomography via non-convex methods.
CoRR, 2017

Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

2016
Location Estimation Using Crowdsourced Spatial Relations.
ACM Trans. Spatial Algorithms Syst., 2016

Group-Sparse Model Selection: Hardness and Relaxations.
IEEE Trans. Inf. Theory, 2016

Algorithms for Learning Sparse Additive Models with Interactions in High Dimensions.
CoRR, 2016

Trading-off variance and complexity in stochastic gradient descent.
CoRR, 2016

Finding Low-rank Solutions to Matrix Problems, Efficiently and Provably.
CoRR, 2016

Provable non-convex projected gradient descent for a class of constrained matrix optimization problems.
CoRR, 2016

A Simple and Provable Algorithm for Sparse Diagonal CCA.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Dropping Convexity for Faster Semi-definite Optimization.
Proceedings of the 29th Conference on Learning Theory, 2016

Finding low-rank solutions to smooth convex problems via the Burer-Monteiro approach.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

Learning Sparse Additive Models with Interactions in High Dimensions.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

Convex Block-sparse Linear Regression with Expanders - Provably.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

Bipartite Correlation Clustering: Maximizing Agreements.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2015
Compressive mining: fast and optimal data mining in the compressed domain.
VLDB J., 2015

Composite self-concordant minimization.
J. Mach. Learn. Res., 2015

Structured Sparsity: Discrete and Convex approaches.
CoRR, 2015

Linear Inverse Problems with Norm and Sparsity Constraints.
CoRR, 2015

Sparse PCA via Bipartite Matchings.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Stay on path: PCA along graph paths.
Proceedings of the 32nd International Conference on Machine Learning, 2015

2014
Rigorous optimization recipes for sparse and low rank inverse problems with applications in data sciences.
PhD thesis, 2014

Fixed-Rank Rayleigh Quotient Maximization by an MPSK Sequence.
IEEE Trans. Commun., 2014

An Inexact Proximal Path-Following Algorithm for Constrained Convex Minimization.
SIAM J. Optim., 2014

Matrix Recipes for Hard Thresholding Methods.
J. Math. Imaging Vis., 2014

Location Estimation Using Crowdsourced Geospatial Narratives.
CoRR, 2014

Fixed-rank Rayleigh Quotient Maximization by an $M$PSK Sequence.
CoRR, 2014

Provable deterministic leverage score sampling.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

Approximate matrix multiplication with application to linear embeddings.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Non-uniform feature sampling for decision tree ensembles.
Proceedings of the IEEE International Conference on Acoustics, 2014

Improving Co-Cluster Quality with Application to Product Recommendations.
Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014

Scalable Sparse Covariance Estimation via Self-Concordance.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Group-Sparse Model Selection: Hardness and Relaxations
CoRR, 2013

Randomized Low-Memory Singular Value Projection
CoRR, 2013

A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions.
Proceedings of the 30th International Conference on Machine Learning, 2013

Sparse projections onto the simplex.
Proceedings of the 30th International Conference on Machine Learning, 2013

Fast proximal algorithms for Self-concordant function minimization with application to sparse graph selection.
Proceedings of the IEEE International Conference on Acoustics, 2013

Sparse simplex projections for portfolio optimization.
Proceedings of the IEEE Global Conference on Signal and Information Processing, 2013

On quantifying qualitative geospatial data: a probabilistic approach.
Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Crowdsourced and Volunteered Geographic Information, 2013

2012
Multi-Way Compressed Sensing for Sparse Low-Rank Tensors.
IEEE Signal Process. Lett., 2012

Sparse projections onto the simplex
CoRR, 2012

MATRIX ALPS: Accelerated low rank and sparse matrix reconstruction.
Proceedings of the IEEE Statistical Signal Processing Workshop, 2012

Combinatorial selection and least absolute shrinkage via the Clash algorithm.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Hard thresholding with norm constraints.
Proceedings of the 2012 IEEE International Conference on Acoustics, 2012

2011
Rank-deficient quadratic-form maximization over M-phase alphabet: Polynomial-complexity solvability and algorithmic developments.
Proceedings of the IEEE International Conference on Acoustics, 2011

Recipes on hard thresholding methods.
Proceedings of the 4th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2011


  Loading...