Mert Pilanci

Orcid: 0000-0002-0870-9992

According to our database1, Mert Pilanci authored at least 107 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Correction to: Sketching the Krylov subspace: faster computation of the entire ridge regularization path.
J. Supercomput., January, 2024

A Library of Mirrors: Deep Neural Nets in Low Dimensions are Convex Lasso Models with Reflection Features.
CoRR, 2024

Adaptive Inference: Theoretical Limits and Unexplored Opportunities.
CoRR, 2024

Convex Relaxations of ReLU Neural Networks Approximate Global Optima in Polynomial Time.
CoRR, 2024

Riemannian Preconditioned LoRA for Fine-Tuning Foundation Models.
CoRR, 2024

Analyzing Neural Network-Based Generative Diffusion Models through Convex Optimization.
CoRR, 2024

Distributed Markov Chain Monte Carlo Sampling based on the Alternating Direction Method of Multipliers.
CoRR, 2024

2023
Sketching the Krylov subspace: faster computation of the entire ridge regularization path.
J. Supercomput., November, 2023

Distributed Sketching for Randomized Optimization: Exact Characterization, Concentration, and Lower Bounds.
IEEE Trans. Inf. Theory, June, 2023

Securely Aggregated Coded Matrix Inversion.
IEEE J. Sel. Areas Inf. Theory, 2023

Randomized Polar Codes for Anytime Distributed Machine Learning.
IEEE J. Sel. Areas Inf. Theory, 2023

The Convex Landscape of Neural Networks: Characterizing Global Optima and Stationary Points via Lasso Models.
CoRR, 2023

Volumetric Reconstruction Resolves Off-Resonance Artifacts in Static and Dynamic PROPELLER MRI.
CoRR, 2023

Polynomial-Time Solutions for ReLU Network Training: A Complexity Classification via Max-Cut and Zonotopes.
CoRR, 2023

From Complexity to Clarity: Analytical Expressions of Deep Neural Network Weights via Clifford's Geometric Algebra and Convexity.
CoRR, 2023

Iterative Sketching for Secure Coded Regression.
CoRR, 2023

Gradient Coding through Iterative Block Leverage Score Sampling.
CoRR, 2023

Complex Clipping for Improved Generalization in Machine Learning.
CoRR, 2023

Federated Coded Matrix Inversion.
CoRR, 2023

Matrix Compression via Randomized Low Rank and Low Precision Factorization.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Path Regularization: A Convexity and Sparsity Inducing Regularization for Parallel ReLU Networks.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Fixing the NTK: From Neural Network Linearizations to Exact Convex Programs.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Optimal Shrinkage for Distributed Second-Order Optimization.
Proceedings of the International Conference on Machine Learning, 2023

Optimal Sets and Solution Paths of ReLU Networks.
Proceedings of the International Conference on Machine Learning, 2023

Parallel Deep Neural Networks Have Zero Duality Gap.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Globally Optimal Training of Neural Networks with Threshold Activation Functions.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Low Precision Representations for High Dimensional Models.
Proceedings of the IEEE International Conference on Acoustics, 2023

Convex Optimization of Deep Polynomial and ReLU Activation Neural Networks.
Proceedings of the IEEE International Conference on Acoustics, 2023

2022
Computational Polarization: An Information-Theoretic Method for Resilient Computing.
IEEE Trans. Inf. Theory, 2022

Adaptive and Oblivious Randomized Subspace Methods for High-Dimensional Optimization: Sharp Analysis and Lower Bounds.
IEEE Trans. Inf. Theory, 2022

A Data-Driven Waveform Adaptation Method for Mm-Wave Gait Classification at the Edge.
IEEE Signal Process. Lett., 2022

Efficient Randomized Subspace Embeddings for Distributed Optimization Under a Communication Budget.
IEEE J. Sel. Areas Inf. Theory, 2022

ReLU Neural Networks Learn the Simplest Models: Neural Isometry and Exact Recovery.
CoRR, 2022

GLEAM: Greedy Learning for Large-Scale Accelerated MRI Reconstruction.
CoRR, 2022

Optimal Neural Network Approximation of Wasserstein Gradient Direction via Convex Optimization.
CoRR, 2022

Minimax Optimal Quantization of Linear Models: Information-Theoretic Limits and Efficient Algorithms.
CoRR, 2022

Using a Novel COVID-19 Calculator to Measure Positive U.S. Socio-Economic Impact of a COVID-19 Pre-Screening Solution (AI/ML).
CoRR, 2022

Using Deep Learning with Large Aggregated Datasets for COVID-19 Classification from Cough.
CoRR, 2022

Hierarchical Multi-modal Transformer for Automatic Detection of COVID-19.
Proceedings of the 2022 5th International Conference on Signal Processing and Machine Learning, 2022

Scale-Equivariant Unrolled Neural Networks for Data-Efficient Accelerated MRI Reconstruction.
Proceedings of the Medical Image Computing and Computer Assisted Intervention - MICCAI 2022, 2022

Orthonormal Sketches for Secure Coded Regression.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Unraveling Attention via Convex Duality: Analysis and Interpretations of Vision Transformers.
Proceedings of the International Conference on Machine Learning, 2022

Fast Convex Optimization for Two-Layer ReLU Networks: Equivalent Model Classes and Cone Decompositions.
Proceedings of the International Conference on Machine Learning, 2022

Neural Fisher Discriminant Analysis: Optimal Neural Network Embeddings in Polynomial Time.
Proceedings of the International Conference on Machine Learning, 2022

The Convex Geometry of Backpropagation: Neural Network Gradient Flows Converge to Extreme Points of the Dual Convex Program.
Proceedings of the Tenth International Conference on Learning Representations, 2022

The Hidden Convex Optimization Landscape of Regularized Two-Layer ReLU Networks: an Exact Characterization of Optimal Solutions.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Hidden Convexity of Wasserstein GANs: Interpretable Generative Models with Closed-Form Solutions.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Demystifying Batch Normalization in ReLU Networks: Equivalent Convex Optimization Models and Implicit Regularization.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Secure Linear MDS Coded Matrix Inversion.
Proceedings of the 58th Annual Allerton Conference on Communication, 2022

Approximate Function Evaluation via Multi-Armed Bandits.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Convex Geometry and Duality of Over-parameterized Neural Networks.
J. Mach. Learn. Res., 2021

Fast Convex Quadratic Optimization Solvers with Adaptive Sketching-based Preconditioners.
CoRR, 2021

Distributed Learning and Democratic Embeddings: Polynomial-Time Source Coding Schemes Can Achieve Minimax Lower Bounds for Distributed Gradient Descent under Communication Constraints.
CoRR, 2021

Neural Spectrahedra and Semidefinite Lifts: Global Convex Optimization of Polynomial Activation Neural Networks in Fully Polynomial-Time.
CoRR, 2021

Newton-LESS: Sparsification without Trade-offs for the Sketched Newton Update.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Adaptive Newton Sketch: Linear-time Optimization with Quadratic Convergence and Effective Hessian Dimensionality.
Proceedings of the 38th International Conference on Machine Learning, 2021

Revealing the Structure of Deep Neural Networks via Convex Duality.
Proceedings of the 38th International Conference on Machine Learning, 2021

Global Optimality Beyond Two Layers: Training Deep ReLU Networks via Convex Programs.
Proceedings of the 38th International Conference on Machine Learning, 2021

Training Quantized Neural Networks to Global Optimality via Semidefinite Programming.
Proceedings of the 38th International Conference on Machine Learning, 2021

Convex Regularization behind Neural Reconstruction.
Proceedings of the 9th International Conference on Learning Representations, 2021

Vector-output ReLU Neural Network Problems are Copositive Programs: Convex Analysis of Two Layer Networks and Polynomial-time Algorithms.
Proceedings of the 9th International Conference on Learning Representations, 2021

Implicit Convex Regularizers of CNN Architectures: Convex Optimization of Two- and Three-Layer Networks in Polynomial Time.
Proceedings of the 9th International Conference on Learning Representations, 2021

Convex Neural Autoregressive Models: Towards Tractable, Expressive, and Theoretically-Backed Models for Sequential Forecasting and Generation.
Proceedings of the IEEE International Conference on Acoustics, 2021

Approximate Weighted C R Coded Matrix Multiplication.
Proceedings of the IEEE International Conference on Acoustics, 2021

Linear Predictive Coding for Acute Stress Prediction from Computer Mouse Movements.
Proceedings of the 43rd Annual International Conference of the IEEE Engineering in Medicine & Biology Society, 2021

2020
Lower Bounds and a Near-Optimal Shrinkage Estimator for Least Squares Using Random Projections.
IEEE J. Sel. Areas Inf. Theory, 2020

Global Multiclass Classification and Dataset Construction via Heterogeneous Local Experts.
IEEE J. Sel. Areas Inf. Theory, 2020

Approximate Weighted CR Coded Matrix Multiplication.
CoRR, 2020

Training Convolutional ReLU Neural Networks in Polynomial Time: Exact Convex Optimization Formulations.
CoRR, 2020

All Local Minima are Global for Two-Layer ReLU Neural Networks: The Hidden Convex Optimization Landscape.
CoRR, 2020

Global Multiclass Classification from Heterogeneous Local Models.
CoRR, 2020

Straggler Robust Distributed Matrix Inverse Approximation.
CoRR, 2020

Convex Duality of Deep Neural Networks.
CoRR, 2020

Distributed Averaging Methods for Randomized Second Order Optimization.
CoRR, 2020

Distributed Sketching Methods for Privacy Preserving Regression.
CoRR, 2020

Global Convergence of Frank Wolfe on One Hidden Layer Networks.
CoRR, 2020

Limiting Spectrum of Randomized Hadamard Transform and Optimal Iterative Sketching Methods.
CoRR, 2020

Effective Dimension Adaptive Sketching Methods for Faster Regularized Least-Squares Optimization.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Optimal Iterative Sketching Methods with the Subsampled Randomized Hadamard Transform.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Debiasing Distributed Second Order Optimization with Surrogate Sketching and Scaled Regularization.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Neural Networks are Convex Regularizers: Exact Polynomial-time Convex Optimization Formulations for Two-layer Networks.
Proceedings of the 37th International Conference on Machine Learning, 2020

Optimal Randomized First-Order Methods for Least-Squares Problems.
Proceedings of the 37th International Conference on Machine Learning, 2020

Weighted Gradient Coding with Leverage Score Sampling.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

Convex Geometry of Two-Layer ReLU Networks: Implicit Autoencoding and Interpretable Models.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Separating the Effects of Batch Normalization on CNN Training Speed and Stability Using Classical Adaptive Filter Theory.
Proceedings of the 54th Asilomar Conference on Signals, Systems, and Computers, 2020

2019
Regularized Momentum Iterative Hessian Sketch for Large Scale Linear System of Equations.
CoRR, 2019

Faster Least Squares Optimization.
CoRR, 2019

Polar Coded Distributed Matrix Multiplication.
CoRR, 2019

Fast and Robust Solution Techniques for Large Scale Linear System of Equations.
Proceedings of the 27th Signal Processing and Communications Applications Conference, 2019

High-Dimensional Optimization in Adaptive Random Subspaces.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Iterative Hessian Sketch with Momentum.
Proceedings of the IEEE International Conference on Acoustics, 2019

Convex Relaxations of Convolutional Neural Nets.
Proceedings of the IEEE International Conference on Acoustics, 2019

Convex Optimization for Shallow Neural Networks.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

Straggler Resilient Serverless Computing Based on Polar Codes.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

Distributed Black-Box optimization via Error Correcting Codes.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

2017
Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence.
SIAM J. Optim., 2017

2016
Fast Randomized Algorithms for Convex Optimization and Statistical Estimation.
PhD thesis, 2016

Iterative Hessian Sketch: Fast and Accurate Solution Approximation for Constrained Least-Squares.
J. Mach. Learn. Res., 2016

2015
Randomized Sketches of Convex Programs With Sharp Guarantees.
IEEE Trans. Inf. Theory, 2015

Sparse learning via Boolean relaxations.
Math. Program., 2015

Randomized sketches for kernels: Fast and optimal non-parametric regression.
CoRR, 2015

Newton Sketch: A Linear-time Optimization Algorithm with Linear-Quadratic Convergence.
CoRR, 2015

2012
Recovery of Sparse Probability Measures via Convex Programming.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Expectation maximization based matching pursuit.
Proceedings of the 2012 IEEE International Conference on Acoustics, 2012

2011
Recovery of sparse perturbations in Least Squares problems.
Proceedings of the IEEE International Conference on Acoustics, 2011

2010
Structured least squares problems and robust estimators.
IEEE Trans. Signal Process., 2010

2009
Structured least squares with bounded data uncertainties.
Proceedings of the IEEE International Conference on Acoustics, 2009


  Loading...