Samuel Vaiter's banner
Samuel Vaiter's profile picture

Samuel Vaiter

@vaiter3,101 subscribers

@CNRS Researcher in maths & computer science. My (current) focus is machine learning and optimization.

Shorts

Gauss-Lucas theorem states that the roots of the derivative of a polynomial with complex coefficients always lie within the convex hull of the original polynomial's roots.

Gauss-Lucas theorem states that the roots of the derivative of a polynomial with complex coefficients always lie within the convex hull of the original polynomial's roots.

51,916 просмотров

Singular Value Decomposition is a matrix factorization that expresses a matrix M as UΣVᵀ, where U and V are orthogonal matrices, and Σ is diagonal. It can interpreted as the action of a rotation, a scaling and a rotation/reflection.

Singular Value Decomposition is a matrix factorization that expresses a matrix M as UΣVᵀ, where U and V are orthogonal matrices, and Σ is diagonal. It can interpreted as the action of a rotation, a scaling and a rotation/reflection.

31,028 просмотров

Morley's theorem (1899) states that the intersections of the adjacent angle trisectors of any triangle defines an equilateral triangle.

Morley's theorem (1899) states that the intersections of the adjacent angle trisectors of any triangle defines an equilateral triangle.

21,929 просмотров

When optimization problems have multiple minima, algorithms favor specific solutions due to their implicit bias. For ordinary least squares (OLS), gradient descent inherently converges to the minimal norm solution among all possible solutions.

When optimization problems have multiple minima, algorithms favor specific solutions due to their implicit bias. For ordinary least squares (OLS), gradient descent inherently converges to the minimal norm solution among all possible solutions.

19,891 просмотров

Videos

Больше нет контента для загрузки