Approximation, sampling and compression in data science: Recent Episodes

Cambridge University

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.

View Details

Mayboroda, S Wednesday 12th June 2019 - 16:00 to 17:00

View Details

DeVore, R Tuesday 21st May 2019 - 16:00 to 17:00

View Details

Dyn, N Thursday 9th May 2019 - 14:00 to 15:00

View Details

Betcke, M Wednesday 1st May 2019 - 13:00 to 14:45

View Details

Roncal, L Monday 8th April 2019 - 15:00 to 16:00

View Details

Haroske, D Monday 25th March 2019 - 11:00 to 12:00

View Details

Berdysheva, E Tuesday 12th March 2019 - 15:00 to 16:30

View Details

Lacey, M Monday 25th February 2019 - 15:00 to 16:00

View Details

Bohn, B Friday 22nd February 2019 - 09:40 to 10:15

View Details

Li, Z Friday 22nd February 2019 - 11:00 to 11:35

View Details

Kunsch, R Thursday 21st February 2019 - 13:40 to 14:15

View Details

Wang, H Thursday 21st February 2019 - 11:40 to 12:15

View Details

Weimar, M Thursday 21st February 2019 - 14:20 to 14:55

View Details

Gnewuch, M Thursday 21st February 2019 - 11:00 to 11:35

View Details

Ryutin, K Thursday 21st February 2019 - 09:40 to 10:15

View Details

Kuehn, T Thursday 21st February 2019 - 09:00 to 09:35

View Details

Rauhut, H Wednesday 20th February 2019 - 09:00 to 09:35

View Details

Webster, C Tuesday 19th February 2019 - 13:40 to 14:15

View Details

Han, B Tuesday 19th February 2019 - 11:40 to 12:15

View Details

Ye, W Tuesday 19th February 2019 - 15:30 to 16:05

View Details

Sickel, W Tuesday 19th February 2019 - 09:00 to 09:35

View Details

Yuan, W Tuesday 19th February 2019 - 11:00 to 11:35

View Details

Yang, D Tuesday 19th February 2019 - 09:40 to 10:15

View Details

Litvak, A Monday 18th February 2019 - 14:20 to 14:55

View Details

Vybiral, J Monday 18th February 2019 - 13:40 to 14:15

View Details

Malykhin, Y Monday 18th February 2019 - 11:40 to 12:15

View Details

Hinrichs, A Monday 18th February 2019 - 11:00 to 11:35

View Details

Wozniakowski, H Monday 18th February 2019 - 09:40 to 10:15

View Details

Novak, E Wednesday 13th February 2019 - 15:00 to 16:30

View Details

Novak, E Monday 11th February 2019 - 15:00 to 16:30