Polynomial approximations -- Calculus II
This lecture is on Calculus II. It follows Part II of the book Calculus Illustrated by Peter Saveliev. The text of the book can be found at http://calculus123.com.
From playlist Calculus II
Approximating Functions in a Metric Space
Approximations are common in many areas of mathematics from Taylor series to machine learning. In this video, we will define what is meant by a best approximation and prove that a best approximation exists in a metric space. Chapters 0:00 - Examples of Approximation 0:46 - Best Aproximati
From playlist Approximation Theory
Convex Norms and Unique Best Approximations
In this video, we explore what it means for a norm to be convex. In particular we will look at how convex norms lead to unique best approximations. For example, for any continuous function there will be a unique polynomial which gives the best approximation over a given interval. Chapte
From playlist Approximation Theory
Error bounds for Taylor approximations -- Calculus II
This lecture is on Calculus II. It follows Part II of the book Calculus Illustrated by Peter Saveliev. The text of the book can be found at http://calculus123.com.
From playlist Calculus II
Polynomial approximation of functions (part 1)
Using a polynomial to approximate a function at f(0). More free lessons at: http://www.khanacademy.org/video?v=sy132cgqaiU
From playlist Calculus
Minimax Approximation and the Exchange Algorithm
In this video we'll discuss minimax approximation. This is a method of approximating functions by minimisation of the infinity (uniform) norm. The exchange algorithm is an iterative method of finding the approximation which minimises the infinity norm. FAQ : How do you make these animatio
From playlist Approximation Theory
Ch1Pr7: Total Differential Approximation
Approximate a differentiable function using the Total Differential Approximation! This is Chapter 1 Problem 7 from the MATH1231/1241 Calculus notes. Presented by Norman Wildberger from the UNSW School of Mathematics and Statisitcs.
From playlist Mathematics 1B (Calculus)
Accuracy of Taylor approximations - Calculus II
This lecture is on Calculus II. It follows Part II of the book Calculus Illustrated by Peter Saveliev. The text of the book can be found at http://calculus123.com.
From playlist Calculus II
Karthik C. S.: Recent Hardness of Approximation results in Parameterized Complexity
In this talk, we survey some recent hardness of approximation results in parameterized complexity such as the inapproximability of the k-clique problem, provide some technical insights, and also highlight some open problems.
From playlist Workshop: Parametrized complexity and discrete optimization
A nearly optimal lower bound on the approximate degree of AC00- Mark Bun
Computer Science/Discrete Mathematics Seminar I Topic: A nearly optimal lower bound on the approximate degree of AC00 Speaker: A nearly optimal lower bound on the approximate degree of AC00 Speaker: Mark Bun Affiliation: Princeton University Date: October 23, 2017 For more videos, pleas
From playlist Mathematics
Chaitanya Swamy: Signaling in Bayesian Games
We study the optimization problem faced by an informed principal in a Bayesian game, who can reveal some information about the underlying random state of nature to the players (thereby influencing their payoffs) so as to obtain a desirable equilibrium. This yields the following signaling p
From playlist HIM Lectures: Trimester Program "Combinatorial Optimization"
On the Approximation Resistance of Balanced Linear Threshold Functions - Aaron Potechin
Computer Science/Discrete Mathematics Seminar I Topic: On the Approximation Resistance of Balanced Linear Threshold Functions Speaker: Aaron Potechin Affiliation: University of Chicago Date: March 25, 2019 For more video please visit http://video.ias.edu
From playlist Mathematics
Small-set expansion in Grassman graph and the 2-to-2 Games Theorem (Lecture 1) by Prahladh Harsha
Discussion Meeting Workshop on Algebraic Complexity Theory  ORGANIZERS Prahladh Harsha, Ramprasad Saptharishi and Srikanth Srinivasan DATE & TIME 25 March 2019 to 29 March 2019 VENUE Madhava Lecture Hall, ICTS Bangalore Algebraic complexity aims at understanding the computationa
From playlist Workshop on Algebraic Complexity Theory 2019
Relative Error Tensor Low Rank Approximation by David Woodruff
Statistical Physics Methods in Machine Learning DATE:26 December 2017 to 30 December 2017 VENUE:Ramanujan Lecture Hall, ICTS, Bengaluru The theme of this Discussion Meeting is the analysis of distributed/networked algorithms in machine learning and theoretical computer science in the "th
From playlist Statistical Physics Methods in Machine Learning
A Framework for Quadratic Form Maximization over Convex Sets -Vijay Bhattiprolu
Computer Science/Discrete Mathematics Seminar II Topic: A Framework for Quadratic Form Maximization over Convex Sets Speaker: Vijay Bhattiprolu Affiliation: Member, School of Mathematics Date: April 28, 2020 For more video please visit http://video.ias.edu
From playlist Mathematics
Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization - Lijie Chen
Computer Science/Discrete Mathematics Seminar I Topic: Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization Speaker: Lijie Chen Affiliation: Massachusetts Institute of Technology Date: February 24, 2020 For more video please visit http://video.ias.edu
From playlist Mathematics
Hardness of Randomized Truthful Mechanisms for Combinatorial Auctions - Jan Vondrak
Jan Vondrak IBM Almaden March 26, 2012 The problem of combinatorial auctions is one of the basic questions in algorithmic mechanism design: how can we allocate/sell m items to n agents with private valuations of different combinations of items, so that the agents are motivated to reveal th
From playlist Mathematics
Polynomial approximation of functions (part 2)
Approximating a function with a polynomial by making the derivatives equal at f(0) (Maclauren Series) More free lessons at: http://www.khanacademy.org/video?v=3JG3qn7-Sac
From playlist Calculus
Abhishek Rathod (7/27/70): Hardness results in discrete Morse theory for 2-complexes
Title: Hardness results in discrete Morse theory for 2-complexes Abstract: In this talk, we will discuss the problem of minimizing the number of critical simplices (Min-Morse Matching) from the point of view of inapproximability and parameterized complexity. Letting n denote the size of a
From playlist ATMCS/AATRN 2020