Programme Theme
Approximation theory is the study of simulating potentially extremely complicated functions, called target functions, with simpler, more easily computable functions called approximants. The purpose of the simulation could be to approximate values of the target function with respect to a given norm, to estimate the integral of the target function, or to compute its minimum value. Approximation theory's relationship with computer science and engineering encourages solutions that are efficient with regards to computation time and space. In addition, approximation theory problems may also deal with real-life restrictions on data, which can be incomplete, expensive, or noisy. As a result, approximation theory often overlaps with sampling and compression problems.
The main aim of this programme is to understand and solve challenging problems in the high-dimensional context, but this aim is dual. On one hand, we would like to use the high-dimensional context to understand classical approximation problems. For example, recent developments have revealed promising new directions towards a break-through in a set of classical unsolved problems related to sampling in hyperbolic cross approximations. On the other hand, we want to understand why classical multivariate approximation methods fail in the modern high-dimensional context and to find methods that will be better and more efficient for modern approximation in very high dimensions. This direction will focus on two conceptual steps: First, replacement of classical smoothness assumptions by structural assumptions, such as those of sparsity used by compressed sensing. Second, the use of a nonlinear method, for instance a greedy algorithm, to find an appropriate sparse approximant.
In order to achieve the goal the programme will bring together researchers from different fields to work in groups on modern problems of high-dimensional approximation and related topics. It will foster exchange between different groups of researchers and practitioners.
Dr. Brad R. Fulton
U.S. Geological Survey
Sinclair Mackenzie
John Russell
Cambridge University
Rob
Itzik Ben-Shabat
Cambridge University
Hamilton Institute
Hamilton Institute
The Open University
Cambridge University
Allen Institute for Artificial Intelligence
Corentin Cadiou
Marihely Martínez
Lefteris Statharas
Yannic Kilcher
Roman Cheplyaka
May
Cambridge University
Yury Petrachenko
Maths Methods
BINUS University
Jeff Holcomb
Type Cast Heroes
Greg Hancock & Patrick Curran
Kris Villez and Jörg Rieckermann
Cambridge University
Pertijs, M.A.P.
Prof. Dr. Andreas Maier
Cambridge University
Machine Learning Street Talk
Carl Haley
Gerhard Klimeck
Numenta
Dev
Daniel Wilson, Hause Lin
AutoML Media
SUNIL KUMAR
emilyallenviera
Primedia Broadcasting
Academy of Achievement
Stanford Materials Computation and Theory Group, Qian Yang's lab at the University of Connecticut
Mimi Ho, Mike Cianfrocco, and Liz Kellogg
KDMac
Fermilab Today Result of the Week
IAH Groundwater
Your Data Teacher
Perimeter Institute
Rohin Shah et al.
Oxford University
Richard M. Golden, Ph.D., M.S.E.E., B.S.E.E.
London Futurists
Gudrun Thäter, Sebastian Ritterbusch
None
Rigaku
Maximus Mapstone
molpigs
Minko Gechev
PaperPlayer
None
Marissa Buzar
Oxford University
Philipp Packmohr
Zygo Corporation
True Spectrum Media
Colin Warwick, Agilent EEsof EDA
[game x]
Cambridge University
University of Twente
Benjamin Himes
UNIL | Université de Lausanne
Utah Hemophilia Foundation
Henry Rzepa
Team TM Podcast
Swinburne University of Technology
Team TM Podcast
Andre Ye
Justin Dingman
ragira.Jr
Paul Middlebrooks
Flux Society
American Mathematical Society
Jean-Claude Bradley
None
Chris Thiel
Center for Evidence-Based Management
PapaPodcasts
Data Skeptic
BINUS University
Nick Cox
Robin Ranjit Singh Chauhan
The Nonlinear Fund
British Tinnitus Association
mapscaping.com
AKSHAY PATIL
Sarvesh Bhatnagar
Dr. Peper
mapscaping.com