default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHolger Rauhut
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Frederik Hoppe, Claudio Mayrink Verdun, Hannah Laus, Sebastian Endt, Marion I. Menzel, Felix Krahmer, Holger Rauhut:
Imaging with Confidence: Uncertainty Quantification for High-Dimensional Undersampled MR Images. ECCV (78) 2024: 432-450- [i50]Frederik Hoppe, Claudio Mayrink Verdun, Felix Krahmer, Marion I. Menzel, Holger Rauhut:
With or Without Replacement? Improving Confidence in Fourier Imaging. CoRR abs/2407.13575 (2024) - [i49]Frederik Hoppe, Claudio Mayrink Verdun, Hannah Laus, Felix Krahmer, Holger Rauhut:
Non-Asymptotic Uncertainty Quantification in High-Dimensional Learning. CoRR abs/2407.13666 (2024) - [i48]Frederik Hoppe, Felix Krahmer, Claudio Mayrink Verdun, Marion I. Menzel, Holger Rauhut:
High-Dimensional Confidence Regions in Sparse MRI. CoRR abs/2407.18964 (2024) - 2023
- [c10]Frederik Hoppe, Felix Krahmer, Claudio Mayrink Verdun, Marion I. Menzel, Holger Rauhut:
High-Dimensional Confidence Regions in Sparse MRI. ICASSP 2023: 1-5 - [c9]Frederik Hoppe, Claudio Mayrink Verdun, Hannah Laus, Felix Krahmer, Holger Rauhut:
Uncertainty Quantification For Learned ISTA. MLSP 2023: 1-6 - [c8]Leonardo Galli, Holger Rauhut, Mark Schmidt:
Don't be so Monotone: Relaxing Stochastic Line Search in Over-Parameterized Models. NeurIPS 2023 - [i47]Hung-Hsu Chou, Holger Rauhut, Rachel A. Ward:
Robust Implicit Regularization via Weight Normalization. CoRR abs/2305.05448 (2023) - [i46]Leonardo Galli, Holger Rauhut, Mark Schmidt:
Don't be so Monotone: Relaxing Stochastic Line Search in Over-Parameterized Models. CoRR abs/2306.12747 (2023) - [i45]Frederik Hoppe, Claudio Mayrink Verdun, Felix Krahmer, Hannah Laus, Holger Rauhut:
Uncertainty quantification for learned ISTA. CoRR abs/2309.07982 (2023) - 2022
- [j21]Yuege Xie, Hung-Hsu Chou, Holger Rauhut
, Rachel A. Ward:
Overparameterization and Generalization Error: Weighted Trigonometric Interpolation. SIAM J. Math. Data Sci. 4(2): 885-908 (2022) - [c7]Vasiliki Kouni, Georgios Paraskevopoulos, Holger Rauhut, George C. Alexandropoulos:
ADMM-DAD Net: A Deep Unfolding Network for Analysis Compressed Sensing. ICASSP 2022: 1506-1510 - [i44]Frederik Hoppe, Felix Krahmer, Claudio Mayrink Verdun, Marion I. Menzel, Holger Rauhut:
Uncertainty quantification for sparse Fourier recovery. CoRR abs/2212.14864 (2022) - 2021
- [j20]Holger Rauhut, Zeljka Stojanac:
Tensor theta norms and low rank recovery. Numer. Algorithms 88(1): 25-66 (2021) - [c6]Vasiliki Kouni, Holger Rauhut:
Spark Deficient Gabor Frame Provides A Novel Analysis Operator For Compressed Sensing. ICONIP (6) 2021: 700-708 - [i43]Vasiliki Kouni, Holger Rauhut:
Spark Deficient Gabor Frame Provides a Novel Analysis Operator for Compressed Sensing. CoRR abs/2103.11233 (2021) - [i42]Sjoerd Dirksen, Johannes Maly, Holger Rauhut:
Covariance estimation under one-bit quantization. CoRR abs/2104.01280 (2021) - [i41]Vasiliki Kouni, Holger Rauhut:
Star DGT: a Robust Gabor Transform for Speech Denoising. CoRR abs/2104.14468 (2021) - [i40]Gabin Maxime Nguegnang, Holger Rauhut, Ulrich Terstiege:
Convergence of gradient descent for learning linear neural networks. CoRR abs/2108.02040 (2021) - [i39]Wiebke Bartolomaeus, Youness Boutaib, Sandra Nestler, Holger Rauhut:
Path classification by stochastic linear recurrent neural networks. CoRR abs/2108.03090 (2021) - [i38]Vasiliki Kouni, Georgios Paraskevopoulos, Holger Rauhut, George C. Alexandropoulos:
ADMM-DAD net: a deep unfolding network for analysis compressed sensing. CoRR abs/2110.06986 (2021) - [i37]Vasiliki Kouni, Holger Rauhut:
Spark Deficient Gabor Frames for Inverse Problems. CoRR abs/2110.09296 (2021) - [i36]Ekkehard Schnoor, Arash Behboodi, Holger Rauhut:
Generalization Error Bounds for Iterative Recovery Algorithms Unfolded as Neural Networks. CoRR abs/2112.04364 (2021) - [i35]Hung-Hsu Chou, Johannes Maly, Holger Rauhut:
More is Less: Inducing Sparsity via Overparameterization. CoRR abs/2112.11027 (2021) - 2020
- [c5]Sandra Nestler, Christian Keup, David Dahmen, Matthieu Gilson, Holger Rauhut, Moritz Helias:
Unfolding recurrence by Green's functions for optimized reservoir computing. NeurIPS 2020 - [i34]Simone Brugiapaglia, Sjoerd Dirksen, Hans Christian Jung, Holger Rauhut:
Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs. CoRR abs/2005.06994 (2020) - [i33]Yuege Xie, Rachel A. Ward, Holger Rauhut, Hung-Hsu Chou:
Weighted Optimization: better generalization by smoother interpolation. CoRR abs/2006.08495 (2020) - [i32]Arash Behboodi, Holger Rauhut, Ekkehard Schnoor:
Generalization bounds for deep thresholding networks. CoRR abs/2010.15658 (2020) - [i31]Hung-Hsu Chou, Carsten Gieshoff, Johannes Maly, Holger Rauhut:
Gradient Descent for Deep Matrix Factorization: Dynamics and Implicit Bias towards Low Rank. CoRR abs/2011.13772 (2020)
2010 – 2019
- 2019
- [i30]Olivier Guédon, Felix Krahmer, Christian Kümmerle, Shahar Mendelson, Holger Rauhut:
On the geometry of polytopes generated by heavy-tailed random vectors. CoRR abs/1907.07258 (2019) - [i29]Bubacarr Bah, Holger Rauhut, Ulrich Terstiege, Michael Westdickenberg:
Learning deep linear neural networks: Riemannian gradient flows and convergence to global minimizers. CoRR abs/1910.05505 (2019) - 2018
- [j19]Sjoerd Dirksen, Guillaume Lecué, Holger Rauhut:
On the Gap Between Restricted Isometry Properties and Sparse Recovery Conditions. IEEE Trans. Inf. Theory 64(8): 5478-5487 (2018) - 2017
- [j18]Holger Rauhut, Christoph Schwab:
Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations. Math. Comput. 86(304): 661-700 (2017) - [i28]Maryia Kabanava, Holger Rauhut:
Masked Toeplitz covariance estimation. CoRR abs/1709.09377 (2017) - [i27]Sjoerd Dirksen, Hans Christian Jung, Holger Rauhut:
One-bit compressed sensing with partial Gaussian circulant matrices. CoRR abs/1710.03287 (2017) - 2016
- [j17]Massimo Fornasier, Steffen Peter, Holger Rauhut, Stephan Worm:
Conjugate gradient acceleration of iteratively re-weighted least squares methods. Comput. Optim. Appl. 65(1): 205-259 (2016) - [i26]Holger Rauhut, Reinhold Schneider, Zeljka Stojanac:
Low rank tensor recovery via iterative hard thresholding. CoRR abs/1602.05217 (2016) - [i25]Shahar Mendelson, Holger Rauhut, Rachel A. Ward:
Improved bounds for sparse recovery from subsampled random convolutions. CoRR abs/1610.04983 (2016) - [i24]Holger Rauhut, Ulrich Terstiege:
Low-rank matrix recovery via rank one tight frame measurements. CoRR abs/1612.03108 (2016) - 2015
- [r1]Massimo Fornasier, Holger Rauhut:
Compressive Sensing. Handbook of Mathematical Methods in Imaging 2015: 205-256 - [i23]Sjoerd Dirksen, Guillaume Lecué, Holger Rauhut:
On the gap between RIP-properties and sparse recovery conditions. CoRR abs/1504.05073 (2015) - [i22]Holger Rauhut, Zeljka Stojanac:
Tensor theta norms and low rank recovery. CoRR abs/1505.05175 (2015) - [i21]Maryia Kabanava, Richard Kueng, Holger Rauhut, Ulrich Terstiege:
Stable low-rank matrix recovery via null space properties. CoRR abs/1507.07184 (2015) - [i20]Dominik Dorsch, Holger Rauhut:
Refined analysis of sparse MIMO radar. CoRR abs/1509.03625 (2015) - 2014
- [j16]Nir Ailon, Holger Rauhut:
Fast and RIP-Optimal Transforms. Discret. Comput. Geom. 52(4): 780-798 (2014) - [j15]Max Hügel, Holger Rauhut, Thomas Strohmer:
Remote Sensing via ℓ 1-Minimization. Found. Comput. Math. 14(1): 115-150 (2014) - [j14]Matthias Weiss, Joachim H. G. Ender, Holger Rauhut, Gilda Schirinzi, Thomas Strohmer, Peter Willett:
Foreword to the special section on compressive sensing applied to radar. IEEE Trans. Aerosp. Electron. Syst. 50(2): 807-808 (2014) - [i19]Felix Krahmer, Holger Rauhut:
Structured random measurements in signal processing. CoRR abs/1401.1106 (2014) - [i18]Holger Rauhut, Reinhold Schneider, Zeljka Stojanac:
Tensor completion in hierarchical tensor representations. CoRR abs/1404.3905 (2014) - [i17]Maryia Kabanava, Holger Rauhut, Hui Zhang:
Robust analysis ℓ1-recovery from Gaussian measurements and total variation minimization. CoRR abs/1407.7402 (2014) - [i16]Ulas Ayaz, Sjoerd Dirksen, Holger Rauhut:
Uniform recovery of fusion frame structured sparse signals. CoRR abs/1407.7680 (2014) - [i15]Richard Kueng, Holger Rauhut, Ulrich Terstiege:
Low rank matrix recovery from rank one measurements. CoRR abs/1410.6913 (2014) - 2013
- [b1]Simon Foucart, Holger Rauhut:
A Mathematical Introduction to Compressive Sensing. Applied and Numerical Harmonic Analysis, Birkhäuser 2013, ISBN 978-0-8176-4947-0, pp. I-XVIII, 1-625 - [i14]Nir Ailon, Holger Rauhut:
Fast and RIP-optimal transforms. CoRR abs/1301.0878 (2013) - [i13]Holger Rauhut, Maryia Kabanava:
Analysis ℓ1-recovery with frames and Gaussian measurements. CoRR abs/1306.1356 (2013) - 2012
- [j13]Holger Rauhut, Rachel A. Ward:
Sparse Legendre expansions via l1-minimization. J. Approx. Theory 164(5): 517-533 (2012) - [i12]Max Hügel, Holger Rauhut, Thomas Strohmer:
Remote sensing via ℓ1 minimization. CoRR abs/1205.1366 (2012) - [i11]Felix Krahmer, Shahar Mendelson, Holger Rauhut:
Suprema of Chaos Processes and the Restricted Isometry Property. CoRR abs/1207.0235 (2012) - 2011
- [j12]Massimo Fornasier, Holger Rauhut, Rachel A. Ward:
Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization. SIAM J. Optim. 21(4): 1614-1640 (2011) - [j11]Petros Boufounos, Gitta Kutyniok, Holger Rauhut:
Sparse Recovery From Combined Fusion Frame Measurements. IEEE Trans. Inf. Theory 57(6): 3864-3876 (2011) - [i10]Götz E. Pfander, Holger Rauhut, Joel A. Tropp:
The restricted isometry property for time-frequency structured random matrices. CoRR abs/1106.3184 (2011) - 2010
- [j10]Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich:
The Gelfand widths of lp-balls for 0p<=1. J. Complex. 26(6): 629-640 (2010) - [j9]Georg Tauböck, Franz Hlawatsch, Daniel Eiwen, Holger Rauhut:
Compressive Estimation of Doubly Selective Channels in Multicarrier Systems: Leakage Effects and Sparsity-Enhancing Processing. IEEE J. Sel. Top. Signal Process. 4(2): 255-271 (2010) - [j8]Yonina C. Eldar, Holger Rauhut:
Average case analysis of multichannel sparse recovery using convex relaxation. IEEE Trans. Inf. Theory 56(1): 505-519 (2010) - [c4]Petros Boufounos, Gitta Kutyniok, Holger Rauhut:
Average case analysis of sparse recovery from combined fusion frame measurements. CISS 2010: 1-6 - [c3]Holger Rauhut, Rachel A. Ward:
Efficient and stable recovery of Legendre-sparse polynomials. CISS 2010: 1-6 - [c2]Daniel Eiwen, Georg Tauböck, Franz Hlawatsch, Holger Rauhut, Nicolai Czink:
Multichannel-compressive estimation of doubly selective channels in MIMO-OFDM systems: Exploiting and enhancing joint sparsity. ICASSP 2010: 3082-3085 - [i9]Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich:
The Gelfand widths of ℓp-balls for 0<p≤1. CoRR abs/1002.0672 (2010) - [i8]Ulas Ayaz, Holger Rauhut:
Nonuniform Sparse Recovery with Gaussian Matrices. CoRR abs/1007.2354 (2010) - [i7]Holger Rauhut, Justin K. Romberg, Joel A. Tropp:
Restricted Isometries for Partial Random Circulant Matrices. CoRR abs/1010.1847 (2010)
2000 – 2009
- 2009
- [i6]Holger Rauhut:
Circulant and Toeplitz matrices in compressed sensing. CoRR abs/0902.4394 (2009) - [i5]Georg Tauboeck, Franz Hlawatsch, Holger Rauhut:
Compressive estimation of doubly selective channels: exploiting channel sparsity to improve spectral efficiency in multicarrier transmissions. CoRR abs/0903.2774 (2009) - [i4]Yonina C. Eldar, Holger Rauhut:
Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation. CoRR abs/0904.0494 (2009) - [i3]Petros Boufounos, Gitta Kutyniok, Holger Rauhut:
Sparse Recovery from Combined Fusion Frame Measurements. CoRR abs/0912.4988 (2009) - 2008
- [j7]Stefan Kunis, Holger Rauhut:
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit. Found. Comput. Math. 8(6): 737-763 (2008) - [j6]Massimo Fornasier, Holger Rauhut:
Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints. SIAM J. Numer. Anal. 46(2): 577-613 (2008) - [j5]Holger Rauhut, Karin Schnass, Pierre Vandergheynst:
Compressed Sensing and Redundant Dictionaries. IEEE Trans. Inf. Theory 54(5): 2210-2219 (2008) - [j4]Holger Rauhut:
Stability Results for Random Sampling of Sparse Trigonometric Polynomials. IEEE Trans. Inf. Theory 54(12): 5661-5670 (2008) - [j3]Götz E. Pfander, Holger Rauhut, Jared Tanner:
Identification of Matrices Having a Sparse Representation. IEEE Trans. Signal Process. 56(11): 5376-5388 (2008) - 2007
- [c1]Rémi Gribonval, Boris Mailhé, Holger Rauhut, Karin Schnass, Pierre Vandergheynst:
Average Case Analysis of Multichannel Thresholding. ICASSP (2) 2007: 853-856 - [i2]Götz E. Pfander, Holger Rauhut:
Sparsity in time-frequency representations. CoRR abs/0711.2503 (2007) - [i1]Holger Rauhut, Karin Schnass, Pierre Vandergheynst:
Compressed Sensing and Redundant Dictionaries. CoRR abs/math/0701131 (2007) - 2005
- [j2]Holger Rauhut:
Best time localized trigonometric polynomials and wavelets. Adv. Comput. Math. 22(1): 1-20 (2005) - [j1]Holger Rauhut:
Wavelet Transforms Associated to Group Representations and Functions Invariant under Symmetry Groups. Int. J. Wavelets Multiresolution Inf. Process. 3(2): 167-187 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-04 20:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
