Raphael A. Meyer

Orcid: 0000-0001-8564-7003

Affiliations:
  • New York University, Tandon School of Engineering, NY, USA
  • Purdue University, Department of Computer Science, West Lafayette, IN, USA (former)


According to our database1, Raphael A. Meyer authored at least 19 papers between 2017 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Quantifying Epistemic Uncertainty in Diffusion Models.
CoRR, February, 2026

Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop.
CoRR, February, 2026

The matrix-vector complexity of Ax=b.
CoRR, February, 2026

Hutchinson's Estimator is Bad at Kronecker-Trace-Estimation.
SIAM J. Matrix Anal. Appl., 2026

Debiasing Polynomial and Fourier Regression.
Proceedings of the 2026 Symposium on Simplicity in Algorithms, 2026

Does block size matter in randomized block Krylov low-rank approximation?
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
Faster Linear Algebra Algorithms with Structured Random Matrices.
CoRR, August, 2025

Algorithm-Agnostic Low-Rank Approximation of Operator Monotone Matrix Functions.
SIAM J. Matrix Anal. Appl., 2025

Understanding the Kronecker Matrix-Vector Complexity of Linear Algebra.
Proceedings of the Forty-second International Conference on Machine Learning, 2025

2024
On the Unreasonable Effectiveness of Single Vector Krylov Methods for Low-Rank Approximation.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Near-Linear Sample Complexity for <i>L<sub>p</sub></i> Polynomial Regression.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Near-Linear Sample Complexity for L<sub>p</sub> Polynomial Regression.
CoRR, 2022

Fast Regression for Structured Inputs.
Proceedings of the Tenth International Conference on Learning Representations, 2022

2021
Hutch++: Optimal Stochastic Trace Estimation.
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

2020
The Statistical Cost of Robust Kernel Hyperparameter Tuning.
CoRR, 2020

The Statistical Cost of Robust Kernel Hyperparameter Turning.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
On the Statistical Efficiency of Optimal Kernel Sum Classifiers.
CoRR, 2019

Optimality Implies Kernel Sum Classifiers are Statistically Efficient.
Proceedings of the 36th International Conference on Machine Learning, 2019

2017
Characterizing optimal security and round-complexity for secure OR evaluation.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017


  Loading...