Dominik Stöger

Orcid: 0000-0002-0543-9456

According to our database1, Dominik Stöger authored at least 21 papers between 2017 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
Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity.
CoRR, 2024

Linear Convergence of Iteratively Reweighted Least Squares for Nuclear Norm Minimization.
Proceedings of the 13th IEEE Sensor Array and Multichannel Signal Processing Workshop, 2024

2023
Robust Recovery of Low-Rank Matrices and Low-Tubal-Rank Tensors from Noisy Sketches.
SIAM J. Matrix Anal. Appl., December, 2023

Randomly Initialized Alternating Least Squares: Fast Convergence for Matrix Sensing.
SIAM J. Math. Data Sci., September, 2023

Upper and lower bounds for the Lipschitz constant of random neural networks.
CoRR, 2023

How to induce regularization in generalized linear models: A guide to reparametrizing gradient flow.
CoRR, 2023

How robust is randomized blind deconvolution via nuclear norm minimization against adversarial noise?
CoRR, 2023

Implicit Balancing and Regularization: Generalization and Convergence Guarantees for Overparameterized Asymmetric Matrix Sensing.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2021
Proof methods for robust low-rank matrix recovery.
CoRR, 2021

Understanding Overparameterization in Generative Adversarial Networks.
CoRR, 2021

Small random initialization is akin to spectral learning: Optimization and generalization guarantees for overparameterized low-rank matrix reconstruction.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Iteratively Reweighted Least Squares for Basis Pursuit with Global Linear Convergence Rate.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Understanding Over-parameterization in Generative Adversarial Networks.
Proceedings of the 9th International Conference on Learning Representations, 2021

2020
Iteratively Reweighted Least Squares for 𝓁<sub>1</sub>-minimization with Global Linear Convergence Rate.
CoRR, 2020

2019
Complex phase retrieval from subgaussian measurements.
CoRR, 2019

On the convex geometry of blind deconvolution and matrix completion.
CoRR, 2019

Sparse power factorization: balancing peakiness and sample complexity.
Adv. Comput. Math., 2019

2018
Blind Demixing and Deconvolution at Near-Optimal Rate.
IEEE Trans. Inf. Theory, 2018

Sparse Power Factorization With Refined Peakiness Conditions.
Proceedings of the 2018 IEEE Statistical Signal Processing Workshop, 2018

Blind Deconvolution: Convex Geometry and Noise Robustness.
Proceedings of the 52nd Asilomar Conference on Signals, Systems, and Computers, 2018

2017
Blind Demixing and Deconvolution with Noisy Data: Near-optimal Rate.
Proceedings of the WSA 2017, 2017


  Loading...