**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Concept# Operator norm

Summary

In mathematics, the operator norm measures the "size" of certain linear operators by assigning each a real number called its . Formally, it is a norm defined on the space of bounded linear operators between two given normed vector spaces. Informally, the operator norm |T| of a linear map T : X \to Y is the maximum factor by which it "lengthens" vectors.
Introduction and definition
Given two normed vector spaces V and W (over the same base field, either the real numbers \R or the complex numbers \Complex), a linear map A : V \to W is continuous if and only if there exists a real number c such that
|Av| \leq c |v| \quad \mbox{ for all } v\in V.
The norm on the left is the one in W and the norm on the right is the one in V.
Intuitively, the continuous operator A never increases the length of any ve

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications

Loading

Related people

Loading

Related units

Loading

Related concepts

Loading

Related courses

Loading

Related lectures

Loading

Related publications (4)

Loading

Loading

Loading

Related people

Related units

No results

No results

Related concepts (32)

Hilbert space

In mathematics, Hilbert spaces (named after David Hilbert) allow the methods of linear algebra and calculus to be generalized from (finite-dimensional) Euclidean vector spaces to spaces that may be

Banach space

In mathematics, more specifically in functional analysis, a Banach space (pronounced ˈbanax) is a complete normed vector space. Thus, a Banach space is a vector space with a metric that allows the co

Lp space

DISPLAYTITLE:Lp space
In mathematics, the Lp spaces are function spaces defined using a natural generalization of the p-norm for finite-dimensional vector spaces. They are sometimes called Lebesgue

Related courses (3)

This is an introductory course in the theory of statistics, inference, and machine learning, with an emphasis on theoretical understanding & practical exercises. The course will combine, and alternate, between mathematical theoretical foundations and practical computational aspects in python.

This course provides an overview of key advances in continuous optimization and statistical analysis for machine learning. We review recent learning formulations and models as well as their guarantees, describe scalable solution techniques and algorithms, and illustrate the trade-offs involved.

This course teaches the students practical skills needed for solving modern physics problems by means of computation. A number of examples illustrate the utility of numerical computations in various domains of physics.

Related lectures (9)

Volkan Cevher, Grigorios Chrysos, Fabian Ricardo Latorre Gomez

While the class of Polynomial Nets demonstrates comparable performance to neural networks (NN), it currently has neither theoretical generalization characterization nor robustness guarantees. To this end, we derive new complexity bounds for the set of Coupled CP-Decomposition (CCP) and Nested Coupled CP-decomposition (NCP) models of Polynomial Nets in terms of the $\ell_\infty$-operator-norm and the $\ell_2$-operator norm. In addition, we derive bounds on the Lipschitz constant for both models to establish a theoretical certificate for their robustness. The theoretical results enable us to propose a principled regularization scheme that we also evaluate experimentally in six datasets and show that it improves the accuracy as well as the robustness of the models to adversarial perturbations. We showcase how this regularization can be combined with adversarial training, resulting in further improvements.

2022,

In this report we study the problem of sparse signal approximation over redundant dictionaries. We focus our attention on the minimization of a cost function where the error is measured using a l1 norm. We show a constructive equivalence between this minimization and Linear Programming. A recovery condition is then proved and finally we provide an example of the use of such a technique for denoising.

2005We revisit the rapid stabilization of the heat equation on the 1-dimensional torus using the backstepping method with a Fredholm transformation. We prove that, under some assumption on the control operator, two scalar controls are necessary and sufficient to get controllability and rapid stabilization. This classical framework allows us to present the backstepping method with the Fredholm transformation upon Laplace operators in a sharp functional setting, which is the major objective of this work, from the Riesz basis properties and the operator equality to the stabilizing spaces. Finally, we prove that the same Fredholm transformation also leads to the local rapid stability of the viscous Burgers equation.

2021