22 results on '"Flinth, Axel"'
Search Results
2. On the linear convergence rates of exchange and continuous methods for total variation minimization
- Author
-
Flinth, Axel, de Gournay, Frédéric, and Weiss, Pierre
- Published
- 2021
- Full Text
- View/download PDF
3. PROMP: A sparse recovery approach to lattice-valued signals
- Author
-
Flinth, Axel and Kutyniok, Gitta
- Published
- 2018
- Full Text
- View/download PDF
4. A geometrical stability condition for compressed sensing
- Author
-
Flinth, Axel
- Published
- 2016
- Full Text
- View/download PDF
5. Multivariate [formula omitted]-molecules
- Author
-
Flinth, Axel and Schäfer, Martin
- Published
- 2016
- Full Text
- View/download PDF
6. Optimization Dynamics of Equivariant and Augmented Neural Networks
- Author
-
Flinth, Axel and Ohlsson, Fredrik
- Subjects
FOS: Computer and information sciences ,Computer Science - Machine Learning ,Optimization and Control (math.OC) ,FOS: Mathematics ,68T07, 20C35, 37N40 ,Mathematics - Optimization and Control ,Machine Learning (cs.LG) - Abstract
We investigate the optimization of multilayer perceptrons on symmetric data. We compare the strategy of constraining the architecture to be equivariant to that of using augmentation. We show that, under natural assumptions on the loss and non-linearities, the sets of equivariant stationary points are identical for the two strategies, and that the set of equivariant layers is invariant under the gradient flow for augmented models. Finally, we show that stationary points may be unstable for augmented training although they are stable for the equivariant models
- Published
- 2023
7. Sparse blind deconvolution and demixing through ℓ 1,2-minimization
- Author
-
Flinth, Axel
- Published
- 2017
- Full Text
- View/download PDF
8. In Search of Projectively Equivariant Networks
- Author
-
Bökman, Georg, Flinth, Axel, and Kahl, Fredrik
- Subjects
FOS: Computer and information sciences ,Computer Vision and Pattern Recognition (cs.CV) ,Computer Science - Computer Vision and Pattern Recognition ,68T07 (Primary) 20C35 (Secondary) - Abstract
Equivariance of linear neural network layers is well studied. In this work, we relax the equivariance condition to only be true in a projective sense. We propose a way to construct a projectively equivariant neural network through building a standard equivariant network where the linear group representations acting on each intermediate feature space are "multiplicatively modified lifts" of projective group representations. By theoretically studying the relation of projectively and linearly equivariant linear layers, we show that our approach is the most general possible when building a network out of linear layers. The theory is showcased in two simple experiments., v2: Significant rewrite. The title has been changed: "neural network" -> "network". More general description of projectively equivariant linear layers, with new proposed architectures, and a completely new accompanying experiment section, as a result
- Published
- 2022
9. Phase Retrieval from Gabor Measurements
- Author
-
Bojarovska, Irena and Flinth, Axel
- Published
- 2016
- Full Text
- View/download PDF
10. Guaranteed blind deconvolution and demixing via hierarchically sparse reconstruction
- Author
-
Flinth, Axel, Roth, Ingo, Gro��, Benedikt, Eisert, Jens, and Wunder, Gerhard
- Subjects
FOS: Computer and information sciences ,Information Theory (cs.IT) ,Computer Science - Information Theory ,FOS: Mathematics ,Numerical Analysis (math.NA) ,Mathematics - Numerical Analysis - Abstract
The blind deconvolution problem amounts to reconstructing both a signal and a filter from the convolution of these two. It constitutes a prominent topic in mathematical and engineering literature. In this work, we analyze a sparse version of the problem: The filter $h\in \mathbb{R}^\mu$ is assumed to be $s$-sparse, and the signal $b \in \mathbb{R}^n$ is taken to be $\sigma$-sparse, both supports being unknown. We observe a convolution between the filter and a linear transformation of the signal. Motivated by practically important multi-user communication applications, we derive a recovery guarantee for the simultaneous demixing and deconvolution setting. We achieve efficient recovery by relaxing the problem to a hierarchical sparse recovery for which we can build on a flexible framework. At the same time, for this we pay the price of some sub-optimal guarantees compared to the number of free parameters of the problem. The signal model we consider is sufficiently general to capture many applications in a number of engineering fields. Despite their practical importance, we provide first rigorous performance guarantees for efficient and simple algorithms for the bi-sparse and generalized demixing setting. We complement our analytical results by presenting results of numerical simulations. We find evidence that the sub-optimal scaling $s^2\sigma \log(\mu)\log(n)$ of our derived sufficient condition is likely overly pessimistic and that the observed performance is better described by a scaling proportional to $ s\sigma$ up to log-factors., Comment: 6 pages, 5 figures
- Published
- 2021
11. Hierarchical Sparse Channel Estimation for Massive MIMO
- Author
-
Wunder, Gerhard, Roth, Ingo, Flinth, Axel, Barzegar, Mahdi, Haghighatshoar, Saeid, Caire, Giuseppe, and Kutyniok, Gitta
- Subjects
FOS: Computer and information sciences ,Information Theory (cs.IT) ,Computer Science - Information Theory - Abstract
The problem of wideband massive MIMO channel estimation is considered. Targeting for low complexity algorithms as well as small training overhead, a compressive sensing (CS) approach is pursued. Unfortunately, due to the Kronecker-type sensing (measurement) matrix corresponding to this setup, application of standard CS algorithms and analysis methodology does not apply. By recognizing that the channel possesses a special structure, termed hierarchical sparsity, we propose an efficient algorithm that explicitly takes into account this property. In addition, by extending the standard CS analysis methodology to hierarchical sparse vectors, we provide a rigorous analysis of the algorithm performance in terms of estimation error as well as number of pilot subcarriers required to achieve it. Small training overhead, in turn, means higher number of supported users in a cell and potentially improved pilot decontamination. We believe, that this is the first paper that draws a rigorous connection between the hierarchical framework and Kronecker measurements. Numerical results verify the advantage of employing the proposed approach in this setting instead of standard CS algorithms., 8 pages, 5 figures
- Published
- 2018
12. Exakte und sanfte Rekonstruktion von strukturierten Signalen mittels atomischer und totaler Variation-Normminimierung
- Author
-
Flinth, Axel, Kutyniok, Gitta, Technische Universität Berlin, Gribonval, Rémi, and Krahmer, Felix
- Subjects
ddc:519 ,ddc:518 ,inverse problems ,518 Numerische Analysis ,signal processing ,inverse Probleme ,Signalbearbeitung ,519 Wahrscheinlichkeiten, angewandte Mathematik ,compressed sensing - Abstract
This thesis treats regularization techniques of inverse problems using TV- and atomic norms. In the first part of the thesis, the two concepts are connected, making a unified treatment in the rest of the thesis possible. Concretely, it is proven that for reasonable dictionaries, atomic norms can be calculated with the help of TV -minimization, and that the TV -norm can be considered as an atomic norm with respect to a special dictionary in a Hilbert space. The theory is formulated in an infinite-dimensional setting - finite dimensional examples are however also included as subcases. In the following chapter, a result on the structure of solutions of TV -regularized problems is proven. Formulated and proven in an abstract setting, it states that in most cases, there will exist sparse solutions of the TV -regularized problems. In the chapter thereafter, exact recovery guarantees are discussed. The main aim of that chapter is to provide a link between TV -minimization and atomic norm-minimization with respect to certain dictionaries in so-called reproducible Kernel Hilbert spaces. These results are then applied to produce recovery guarantees for measurement models not previously treated in the literature. In the chapter thereafter, the framework of soft recovery is developed. A method is presented to prove approximate support recovery guarantees. This is first formulated in a very general manner, and then applied to numerous examples. New results on the recoverability of large peaks in standard, finite dimensional dictionary sparse recovery is proven, as well as soft recovery guarantees for several different types of superresolution problems. In the final chapter, methods for numerical resolution of infinite dimensional TV-regularized problems are discussed. The main novel finding is a connection between grid discretization of the TV -regularized problem and linearization of the operator used to probe the signal., Diese Doktorarbeit behandelt Regularisierungstechniken für inverse Probleme, die TV- und atomische Normen verwenden. Im ersten Tail der Arbeit werden die beiden Konzepte verbunden, so dass eine einheitliche Behandlung in den weiteren Teilen der Arbeit möglich ist. Konkret wird bewiesen dass atomische Norme für vernünftige Dictionaries mittels TV-minimierung berechnet werden können, und dass die TV-Norm als eine atomische Norm bezüglich eines bestimmten Dictionary in einem Hilbertraum aufgefasst werden kann. Die Theorie wird in einem unendlichdimensionalen Rahmen formuliert, endlichdimensionale Beispiele sind allerdings auch als Spezialfälle inkludiert. Im darauffolgenden Kapitel wird ein Resultat zur Struktur von Lösungen von TV-regularisierte Probleme bewiesen. Das Resultat wird in einem abstrakten Rahmen formuliert und bewiesen, und sagt aus, dass es in den meisten Fällen dünn besetzte Lösungen existieren. Im Kapitel danach werden exakte Rekonstruktionsgarantien diskutiert. Das Hauptzeil dieses Kapitels ist es, eine Verbindung zwischen TV-Minimierung und atomische Norm-Minimierung bezüglich bestimmte Dictionaries in sogenannten Reproducing Kernel-Hilberträume herzustelen. Diese Resultate werden danach verwendet, um Rekonstruktionsgarantien zu erzeugen für Messmodelle, die bisher nicht betrachtet wurden. Im nächsten Kapitel wird das Konzept der sanften Rekonstruktion entwickelt. Es wird eine Methode vorgestellt, die verwendet werden kann, um approximative Trägerrekonstruktionsgarantien zu beweisen. Diese wird zunächst in einer sehr allgemeinen Form formuliert, und anschließend an mehreren Beispielen appliziert. Es werden sowohl eue Resultate zur Rekonstruktionsmöglichkeit von große Komponenten in endlichdimensionale Dictionary-dünn-besetzte Signale, als auch sanfte Rekonstruktionsgarantien für mehrere Arten von Superresolutionsprobleme bewiesen. Im letzten Kapitel werden Methode zur numerischen Lösung von unendlichdimensionale TV-regularisierte Probleme diskutiert. Das hauptsächliche neue Erkenntnis ist die Herstellung einer Verbindung zwischen Gitterdiskretizierung vom TV-regularisierten Problem und eine Linearisierung des Operators, die für die Messung der Signale verwendet wird.
- Published
- 2018
13. Estimation of Angles of Arrival Through Superresolution -- A Soft Recovery Approach for General Antenna Geometries
- Author
-
Barzegar, Mahdi, Caire, Guiseppe, Flinth, Axel, Haghighatshoar, Saeid, Kutyniok, Gitta, and Wunder, Gerhard
- Subjects
Signal Processing (eess.SP) ,FOS: Electrical engineering, electronic engineering, information engineering ,Electrical Engineering and Systems Science - Signal Processing - Abstract
The estimation of direction of arrivals with help of $TV$-minimization is studied. Contrary to prior work in this direction, which has only considered certain antenna placement designs, we consider general antenna geometries. Applying the soft-recovery framework, we are able to derive a theoretic guarantee for a certain direction of arrival to be approximately recovered. We discuss the impact of the recovery guarantee for a few concrete antenna designs. Additionally, numerical simulations supporting the findings of the theoretical part are performed.
- Published
- 2017
14. Thermal Source Localization Through Infinite-Dimensional Compressed Sensing
- Author
-
Flinth, Axel and Hashemi, Ali
- Subjects
Signal Processing (eess.SP) ,65K10, 90C25, 46N99 ,FOS: Electrical engineering, electronic engineering, information engineering ,FOS: Mathematics ,Numerical Analysis (math.NA) ,Mathematics - Numerical Analysis ,Electrical Engineering and Systems Science - Signal Processing - Abstract
We propose a scheme utilizing ideas from infinite dimensional compressed sensing for thermal source localization. Using the soft recovery framework of one of the authors, we provide rigorous theoretical guarantees for the recovery performance. In particular, we extend the framework in order to also include noisy measurements. Further, we conduct numerical experiments, showing that our proposed method has strong performance, in a wide range of settings. These include scenarios with few sensors, off-grid source positioning and high noise levels, both in one and two dimensions.
- Published
- 2017
15. Soft Recovery With General Atomic Norms
- Author
-
Flinth, Axel
- Subjects
52A41, 90C25 ,FOS: Mathematics ,Numerical Analysis (math.NA) ,Mathematics - Numerical Analysis - Abstract
This paper describes a dual certificate condition on a linear measurement operator $A$ (defined on a Hilbert space $\mathcal{H}$ and having finite-dimensional range) which guarantees that an atomic norm minimization, in a certain sense, will be able to approximately recover a structured signal $v_0 \in \mathcal{H}$ from measurements $Av_0$. Put very streamlined, the condition implies that peaks in a sparse decomposition of $v_0$ are close the the support of the atomic decomposition of the solution $v^*$. The condition applies in a relatively general context - in particular, the space $\mathcal{H}$ can be infinite-dimensional. The abstract framework is applied to several concrete examples, one example being super-resolution. In this process, several novel results which are interesting on its own are obtained.
- Published
- 2017
16. Recovery of Binary Sparse Signals With Biased Measurement Matrices.
- Author
-
Flinth, Axel and Keiper, Sandra
- Subjects
- *
MATRICES (Mathematics) , *SPARSE matrices , *NOISE measurement , *MEASUREMENT , *ORTHOPEDIC casts - Abstract
This paper treats the recovery of sparse, binary signals through box-constrained basis pursuit using biased measurement matrices. Using a probabilistic model, we provide conditions under which the recovery of both sparse and saturated binary signals is very likely. In fact, we also show that under the same condition, the solution of the boxed-constrained basis pursuit program can be found using boxed-constrained least squares. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
17. Multivariate $\alpha$-molecules
- Author
-
Flinth, Axel and Schäfer, Martin
- Subjects
Mathematics - Functional Analysis ,41A30, 41A63, 42C40 - Abstract
The suboptimal performance of wavelets with regard to the approximation of multivariate data gave rise to new representation systems, specifically designed for data with anisotropic features. Some prominent examples of these are given by ridgelets, curvelets, and shearlets, to name a few. The great variety of such so-called directional systems motivated the search for a common framework, which unites many under one roof and enables a simultaneous analysis, for example with respect to approximation properties. Building on the concept of parabolic molecules, the recently introduced framework of $\alpha$-molecules does in fact include the previous mentioned systems. Until now however it is confined to the bivariate setting, whereas nowadays one often deals with higher dimensional data. This motivates the extension of this unifying theory to dimensions larger than 2, put forward in this work. In particular, we generalize the central result that the cross-Gramian of any two systems of $\alpha$-molecules will to some extent be localized. As an exemplary application, we investigate the sparse approximation of video signals, which are instances of 3D data. The multivariate theory allows us to derive almost optimal approximation rates for a large class of representation systems.
- Published
- 2015
18. Exact solutions of infinite dimensional total-variation regularized problems.
- Author
-
Flinth, Axel and Weiss, Pierre
- Subjects
- *
INVERSE problems , *BANACH spaces , *LINEAR operators , *LENGTH measurement - Abstract
We study the solutions of infinite dimensional inverse problems over Banach spaces. The regularizer is defined as the total variation of a linear mapping of the function to recover, while the data fitting term is a near arbitrary function. The first contribution describes the solution's structure: we show that under mild assumptions, there always exists an |$m$| -sparse solution, where |$m$| is the number of linear measurements of the signal. Our second contribution is about the computation of the solution. While most existing works first discretize the problem, we show that exact solutions of the infinite dimensional problem can be obtained by solving one or two consecutive finite dimensional convex programs depending on the measurement functions structures. We finish by showing an application on scattered data approximation. These results extend recent advances in the understanding of total-variation regularized inverse problems. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
19. Low-Overhead Hierarchically-Sparse Channel Estimation for Multiuser Wideband Massive MIMO.
- Author
-
Wunder, Gerhard, Stefanatos, Stelios, Flinth, Axel, Roth, Ingo, and Caire, Giuseppe
- Abstract
Numerical evidence suggests that compressive sensing (CS) approaches for wideband massive MIMO channel estimation can achieve very good performance with limited training overhead by exploiting the sparsity of the physical channel. However, analytical characterization of the (minimum) training overhead requirements is still an open issue. By observing that the wideband massive MIMO channel can be represented by a vector that is not simply sparse but has well defined structural properties, referred to as hierarchical sparsity, we propose low complexity channel estimators for the uplink multiuser scenario that take this property into account. By employing the framework of the hierarchical restricted isometry property, rigorous performance guarantees for these algorithms are provided suggesting concrete design goals for the user pilot sequences. For a specific design, we analytically characterize the scaling of the required pilot overhead with increasing number of antennas and bandwidth, revealing that, as long as the number of antennas is sufficiently large, it is independent of the per user channel sparsity level as well as the number of active users. These analytical insights are verified by simulations demonstrating also the superiority of the proposed algorithm over conventional CS algorithms that ignore the hierarchical sparsity property. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
20. l1,2-Minimization and Soft Recovery.
- Author
-
Flinth, Axel
- Published
- 2017
- Full Text
- View/download PDF
21. Sparse blind deconvolution and demixing through ℓ -minimization.
- Author
-
Flinth, Axel
- Subjects
- *
SPARSE matrices , *DECONVOLUTION (Mathematics) , *SPARSE approximations - Abstract
This paper concerns solving the sparse deconvolution and demixing problem using ℓ -minimization. We show that under a certain structured random model, robust and stable recovery is possible. The results extend results of Ling and Strohmer (Inverse Probl. 31, 115002 2015), and in particular theoretically explain certain experimental findings from that paper. Our results do not only apply to the deconvolution and demixing problem, but to recovery of column-sparse matrices in general. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
22. Optimal Choice of Weights for Sparse Recovery With Prior Information.
- Author
-
Flinth, Axel
- Subjects
- *
COMPRESSED sensing , *ALGORITHM research , *CONVEX geometry , *MATRICES (Mathematics) , *LINEAR equations - Abstract
Compressed sensing deals with the recovery of sparse signals from linear measurements. Without any additional information, it is possible to recover an s -sparse signal using m \gtrsim s \log (d/s) measurements in a robust and stable way. Some applications provide additional information, such as on the location the support of the signal. Using this information, it is conceivable that the threshold amount of measurements can be lowered. A proposed algorithm for this task is weighted \ell 1 -minimization. Put shortly, one modifies standard \ell 1 -minimization by assigning different weights to different parts of the index set $[1, \ldots d]$ . The task of choosing the weights is, however, non-trivial. This paper provides a complete answer to the question of an optimal choice of the weights. In fact, it is shown that it is possible to directly calculate unique weights that are optimal in the sense that the threshold amount of measurements needed for exact recovery is minimized. The proof uses recent results about the connection between convex geometry and compressed sensing-type algorithms. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.