Information-based complexity

Programme

Monday, April 27th

8:00 – 8:45

Breakfast

8:50 – 8:55

Opening

9:00 – 10:00

Anargyros Papageorgiou

Quantum algorithms and complexity

Chair: Stefan Heinrich, room C

10:00 – 10:30

Coffee break

 

 

 

10:30 – 11:00

 



11:00 – 11:30

 



11:30 – 12:00

 

 




12:00 – 12:30

Session 1, room C

Chair: Jim Calvin

Session 2, room A

Chair: Larisa Yaroslavtseva

Maciej Goćwin

Randomized and quantum complexity of nonlinear two-point BVPs

Stephan Dahlke

Besov regularity for the solutions to integral equations

Alexey Khartov

Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements

Anders Hansen

Can everything be computed? - On the solvability complexity index and towers of algorithms

Robert Kunsch

Bernstein Numbers and the Monte Carlo Error

Ewaryst Rafajłowicz and Ewa Skubalska-Rafajłowicz

Well-distributed sequences generated by using space-filling curves and their applications


Piotr Zgliczyński

New lower bound estimates for quadratures of bounded analytic functions

Mario Hefter

Mixed precision multilevel Monte Carlo algorithms on hybrid computing systems

 

13:00 – 14:00

Lunch

 

15:00 – 16:00

Martin Hutzenthaler

A perturbation formula as universal tool for strong approximations of stochastic differential equations

Chair: Klaus Ritter, room C

16:00 – 16:30

Coffee break

 

 

 

16:30 – 17:00

 



17:00 – 17:30

 


17:30 – 18:00

 

Session 1, room C

Chair: Markus Weimar

Session 2, room A

Chair: Piotr Zgliczyński

Klaus Ritter

Non-uniform spatial discretization of an SPDE on the real line

Klaus Meer

An extended tree-width notion for directed graphs related to the computation of permanents

Steffen Dereich

A complexity theorem for multilevel stochastic approximation

Daniel Rudolf

Perturbation theory for Markov chains via Wasserstein distance

Andre Herzwurm

Optimal strong approximation of squared Bessel processes

Marek Kowalski

On complexity of anti-plagiarism

 

18:30

Dinner and campfire

 

Tuesday, April 28th

8:00 – 8:45

Breakfast

9:00 – 10:00

Josef Dick

Polynomial tractability bounds for numerical integration using QMC rules based on Korobov-p-sets and related point sets

Chair: Ian Sloan, room C

10:00

Photo session (palace)

10:00 – 10:30

Coffee break

 

 

 

10:30 – 11:00

 

 


11:00 – 11:30

 

 

11:30 – 12:00

 

 

12:00 – 12:30

Session 1, room C

Chair: Takashi Goda

Session 2, room A

Chair: Steffen Dereich

Aicke Hinrichs

Optimal QMC on higher order digital nets

Larisa Yaroslavtseva

On SDEs with arbitrary slow convergence rate for strong approximation at the final time

Friedrich Pillichshammer

Open type quasi-Monte Carlo integration based on Halton sequences in weighted Sobolev spaces

Andreas Neuenkirch

Optimal approximation of the fractional Lévy area at a single point

Christoph Aistleitner

Discrepancy theory for non-uniform measures

Gunther Leobacher

A numerical method for SDEs with discontinuous drift

Caroline Lasser

Discretising the Herman-Kluk Propagator

Ryan Kurniawan

Weak convergence rates for stochastic partial differential equations

 

13:00 – 14:00

Lunch

15:00 – 16:00

Bolesław Kacewicz and Paweł Przybyłowicz

Complexity of piecewise regular problems

Chair: Aicke Hinrichs, room C

16:00 – 16:30

Coffee break

 

 

 

16:30 – 17:00

 

 

17:00 – 17:30

 

 

17:30 – 18:00

 

Session 1, room C

Chair: Dmitriy Bilyk

Session 2, room A

Chair: Peter Mathé

Stefan Heinrich

On the complexity of parametric indefinite integration and ODEs

Nurlan Temirgaliyev

Some results on the optimal choice of computational aggregates

Dauren Bazarkhanov

Approximate recovery of pseudodifferential operators

Gowri Suryanarayana

Copy rules

Van Kien Nguyen

Bernstein numbers of embeddings of isotropic Besov spaces

Takashi Goda

Construction of interlaced polynomial lattice rules achieving accelerating convergence for a class of infinitely smooth functions

 

18:30

Dinner

Wednesday, April 29th

8:00 – 8:45

Breakfast

 

8:55 – 9:00

IBC Prize

 

9:00 – 10:00

Sergei Pereverzev

On the convergence rate and some applications of regularized ranking algorithms

Chair: Michael Griebel, room C

 

10:00 – 10:30

Coffee break

 

 

 

10:30 – 11:00

 


11:00 – 11:30

 

 

11:30 – 12:00

Session 1, room C

Chair: Ronald Cools

Session 2, room A

Chair: Ewaryst   Rafajłowicz

Teresa Regińska

Regularization strategy for determining laser beam quality parameters

Kinjal Basu

Quasi-Monte Carlo on product spaces

Peter Mathé

Posterior contraction in Bayesian inverse problems

Paweł Morkisz

Approximation of piecewise smooth functions from inexact information

Markus Weimar

(s,t)-weak tractability

Alexander Gilbert

A variant of the component-by-component construction that also chooses the weight parameters

 

12:30 – 13:30

Lunch

 

13:30 – 18:30

Excursion (Poznań or Kórnik)

 

19:00

Conference dinner


Thursday, April 30th

8:00 – 8:45

Breakfast

9:00 – 10:00

Peter Kritzer

Tractability of multivariate problems defined over Hilbert spaces with exponential weights

Chair: Friedrich Pillichshammer, room C

10:00 – 10:30

Coffee break

 

 

 

10:30 – 11:00

 

 

 

11:00 – 11:30

 


11:30 – 12:00

 

 

 

12:00 – 12:30

Session 1, room C

Chair: Gunther Leobacher

Session 2, room A

Chair: Andreas Neuenkirch

Kosuke Suzuki

Accelerating convergence and tractability of multivariate integration for infinitely times differentiable functions

Michael Griebel

Sharp bounds for certain exponential sums with applications to tensor product approximation of analytic functions

Christian Irrgeher

Approximation in Hermite spaces of analytic functions

Jan Schneider

Equivalence of anchored and ANOVA spaces via interpolation

Helene Laimer

On standard tractability notions of integration in Hermite spaces

Florian Puchhammer

An improved bound for the star discrepancy of sequences in the unit interval

Shun Zhang

Complexity of oscillatory integrals on the real line

Ralph Kritzinger

discrepancy of modified van der Corput sequences and Hammersley point sets

 

13:00 – 14:00

Lunch

15:00 – 16:00

Jan Vybiral

Approximation, tractability, and applications

Chair: Winfried Sickel, room C

16:00 – 16:30

Coffee break

 

 

 

16:30 – 17:00

 

 

17:00 – 17:30

 

 

 

17:30 – 18:00

 

Session 1, room C

Chair: Teresa Regińska

Session 2, room A

Chair: Klaus Meer

Simon Foucart

Exponential decay of reconstruction error from binary measurements of sparse signals

Shu Tezuka

New developments of -sequences

Sebastian Mayer

Reconstruction of ridge functions from function values

Heidi Weyhausen

Expected discrepancies

Houying Zhu

Discrepancy bound for deterministic acceptance-rejection sampler beyond in dimension

Stefano De Marchi

On a new quasi-Monte Carlo technique

 

 

18:30

Dinner

Friday, May 1st

8:00 – 8:45

Breakfast

 

9:00 – 10:00

Tino Ullrich

Hyperbolic cross approximation

Chair: Stephan Dahlke, room C

 

10:00 – 10:30

Coffee break

 

 

 

10:30 – 11:00

 


11:00 – 11:30

 

 

 

11:30 – 12:00

 

Session 1, room C

Chair: Jan Schneider

Session 2, room A

Chair: Shu Tezuka

Mario Ullrich

A universal cubature formula for functions with mixed smoothness

Johann Brauchart

Discrepancy of Fibonacci lattices in the square and on the sphere

Dmitriy Bilyk

Sphere tesselations and discrepancy

Lev Markhasin

-discrepancy of higher order digital sequences

Ian Sloan

Option pricing and ANOVA decomposition for an infinite number of variables –
apology and correction

 

13:00 – 14:00

Lunch

 

14:30 – 15:30

Grzegorz Wasilkowski

On equivalence of weighted anchored and ANOVA spaces

Chair: Christoph Aistleitner, room C

 

15:30 – 16:00

In Memory of Kris Sikorski
Marek Kowalski and Henryk Woźniakowski

 

16:00

Coffee

 

18:30

Dinner