Paper# | Topic | Title | Authors |
1013 | A | Iterative hard thresholding with joint constraints | Thomas Blumensath*, University of Southampton |
1071 | A | Local Linear Convergence of Forward--Backward Splitting for Low Complexity Regularization | Jingwei Liang*, Jalal Fadili, ENSICAEN; Gabriel Peyré, CNRS & Université Paris-Dauphine, CEREMADE |
1088 | A | Contrast re-enhancement of Total-Variation regularization jointly with the Douglas-Rachford iterations | Charles-Alban Deledalle*, Nicolas Papadakis, IMB - CNRS, Univ Bordeaux; Joseph Salmon, CNRS LTCI – Télécom ParisTech |
1120 | A | Local Linear Convergence of FISTA | Patrick Johnstone*, Pierre Moulin, University of Illinois |
1143 | A | Communication-Efficient Distributed IHT | Puxiao Han*, Ruixin Niu, Virginia Commonwealth Univ.; Yonina Eldar, Technion |
1036 | B | Linear embeddings of low-dimensional subsets of a Hilbert space to R^m | Gilles Puy*, INRIA; Mike Davies, U Edinburgh; Remi Gribonval, Centre de Recherche INRIA Rennes |
1070 | B | Improved RIP Guarantees for certain Deterministic Matrices based on Coherence | Arash Amini*, Sharif University of Tech. |
1031 | C | Heuristic Optimality Checks for Noise-Aware Sparse Recovery by l1-Minimization | Christoph Brauer*, Dirk Lorenz, TU Braunschweig; Andreas Tillmann, TU Darmstadt |
1032 | C | A sublinear parallel algorithm for combinatorial compressed sensing | Rodrigo Mendoza Smith*, Jared Tanner, University of Oxford |
1033 | C | Phase Transitions for Non-Adaptive Group Testing | Jonathan Scarlett*, Volkan Cevher, EPFL - Lausanne |
1058 | C | Geometric Conditions for Subspace-Sparse Recovery | Chong You*, Rene Vidal, The Johns Hopkins University |
1072 | C | Asymptotic of Sparse Support Recovery for Positive Measures | Quentin DENOYELLE*, Université Paris-Dauphine; Vincent Duval, INRIA Rocquencourt; Gabriel Peyré, CNRS & Université Paris-Dauphine, CEREMADE |
1080 | C | Time-data tradeoff for the sparse and cosparse regularizations of physics-driven inverse problems | Srdan Kitic*, INRIA; Nancy Bertin, IRISA; Remi Gribonval, Centre de Recherche INRIA Rennes |
1136 | C | MRI SNR Improvement Utilizing Sparsity of Difference Between Slices | Lior Weizman*, Jonatan Chernyak, Amit Solomon, Yonina Eldar, Moran Artzi, Dafna Ben Bashat, Technion |
1087 | D | Image inpainting using low-rank block Hankel structured matrix from local patches | Kyong Hwan Jin, Jong Chul Ye*, Dept. of Bio and Brain Engineering, KAIST |
1097 | D | Online Robust Matrix Completion | Brian Lois, Namrata Vaswani*, Iowa State University |
1112 | D | Low-Rank Matrix Recovery from Row&Column Measurements | Avishai Wagner*, Or Zuk, Hebrew University of Jerusalem |
1145 | D | Sparse Self-Expressive Decompositions for Dimensionality Reduction and Clustering | Eva Dyer*, Rehab. Inst. of Chicago; Raajen Patel, Rich Baraniuk, Rice University; Konrad Kording, Northwestern University; Tom Goldstein, University of Maryland |
12 | I | CEL0: a continuous alternative to l0 penalty | Emmanuel Soubies*, Laure Blanc-Féraud, UNS, CNRS I3S; Gilles Aubert, UNS, CNRS JAD |
1016 | I | Expected Patch Log Likelihood with a Sparse Enforcing Prior | Jeremias Sulam*, Michael Elad, Technion |
1024 | I | Quadratically fast IRLS for sparse signal recovery | Chiara Ravazzi*, Enrico Magli, Politecnico di Torino |
1029 | I | Compressive Gaussian Mixture Estimation by Orthogonal Matching Pursuit with Replacement | Nicolas Keriven*, IRISA Rennes; Remi Gribonval, Centre de Recherche INRIA Rennes |
1039 | I | Sparse Gradient Regularisation in Discrete and Continuous Spaces | Jan Lellmann*, University of Cambridge; Evgeny Strekalovskiy, Daniel Cremers, TU Munich |
1041 | I | Too Relaxed? Tightly Relaxed Non-convex Sparse Regularization | Ankit Parekh*, Ivan Selesnick, New York University |
1046 | I | Markov-tree Bayesian Group-sparse Modeling: Efficient Solutions to Large Inverse Problems | Ganchi Zhang*, Nick Kingsbury, University of Cambridge |
1061 | I | The Ordered Weighted l1 Norm: Atomic Formulation and Conditional Gradient Algorithm | Mario Figueiredo*, Xiangrong Zeng, IT, IST, University of Lisbon |
1073 | I | Local Linear Convergence of Douglass--Rachford/ADMM for Low Complexity Regularization | Jingwei Liang*, Jalal Fadili, ENSICAEN; Gabriel Peyré, CNRS & Université Paris-Dauphine, CEREMADE; Russell Luke, University of Göttingen |
1085 | I | Smoothing Doesn't Improve the Convergence Rate of LASSO | Subhadip Mukherjee*, Chandra Sekhar Seelamantula, Indian Institute of Science |
1092 | I | Sparsity for Overparameterized Variational Problems | Raja Giryes*, Duke University; Michael Elad, Alfred Bruckstein, Technion |
1104 | I | A Bayesian Method for Sparse Approximation of Functions | Michael Tipping*, N/A |
1113 | I | On noise robustness in sparse analysis | Marc Nicodème*, IMS; Charles Dossal, IMB; Flavius Turcu, IMS |
1131 | I | Pseudo Marginal MCMC for Parameter Estimation in Alpha Stable Distributions | Marina Riabiz*, Fredrik Lindsten, Simon Godsill, University of Cambridge |
1110 | K | Reconstruction of Sparse Translations of Multivariate Gaussians via Prony’s Method | Thomas Peter*, University of Osnabrück |