Takashi Goda

Orcid: 0000-0001-6055-8055

According to our database1, Takashi Goda authored at least 62 papers between 2014 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Quasi-Monte Carlo with a Hankel random digital net.
CoRR, April, 2026

Worst-case L<sub>p</sub>-approximation of periodic functions using median lattice algorithms.
CoRR, March, 2026

A simple universal algorithm for high-dimensional integration.
Numerische Mathematik, February, 2026

Space-filling lattice designs for computer experiments.
CoRR, February, 2026

Quasi-Monte Carlo hyperinterpolation.
J. Comput. Appl. Math., 2026

Disproving the quasi-uniformity of the Halton sequences and of some Halton-type sequences.
J. Complex., 2026

A note on approximation in weighted Korobov spaces via multiple rank-1 lattices.
J. Complex., 2026

L 2 -approximation using randomized lattice algorithms.
J. Approx. Theory, 2026

Hidden low-discrepancy structures in random point sets.
Appl. Math. Lett., 2026

2025
A lattice algorithm with multiple shifts for function approximation in Korobov spaces.
CoRR, November, 2025

Constructive quasi-uniform sequences over triangles.
CoRR, November, 2025

Universal L<sub>2</sub>-approximation using median lattice algorithms.
CoRR, September, 2025

Optimality of quasi-Monte Carlo methods and suboptimality of the sparse-grid Gauss-Hermite rule in Gaussian Sobolev spaces.
CoRR, September, 2025

The median trick does not help for fully nested scrambling.
CoRR, July, 2025

L<sub>2</sub>-approximation using median lattice algorithms.
CoRR, January, 2025

A randomized lattice rule without component-by-component construction.
Math. Comput., 2025

Tractability results for integration in subspaces of the Wiener algebra.
J. Complex., 2025

A note on unshifted lattice rules for high-dimensional integration in weighted unanchored Sobolev spaces.
Appl. Math. Lett., 2025

2024
A Universal Median Quasi-Monte Carlo Integration.
SIAM J. Numer. Anal., February, 2024

How Sharp Are Error Bounds? -Lower Bounds on Quadrature Worst-Case Errors for Analytic Functions-.
SIAM J. Numer. Anal., 2024

Some tractability results for multivariate integration in subspaces of the Wiener algebra.
CoRR, 2024

L<sub>2</sub>-approximation using randomized lattice algorithms.
CoRR, 2024

2023
Suboptimality of Gauss-Hermite Quadrature and Optimality of the Trapezoidal Rule for Functions with Finite Smoothness.
SIAM J. Numer. Anal., June, 2023

Improved bounds on the gain coefficients for digital nets in prime power base.
J. Complex., June, 2023

Randomizing the trapezoidal rule gives the optimal RMSE rate in Gaussian Sobolev spaces.
Math. Comput., 2023

Constructing unbiased gradient estimators with finite variance for conditional stochastic optimization.
Math. Comput. Simul., 2023

An efficient estimation of nested expectations without conditional sampling.
J. Comput. Appl. Math., 2023

Are quasi-Monte Carlo sequences quasi-uniform?
CoRR, 2023

Estimating nested expectations without inner conditional sampling and application to value of information analysis.
CoRR, 2023

Strong tractability for multivariate integration in a subspace of the Wiener algebra.
CoRR, 2023

2022
Construction-Free Median Quasi-Monte Carlo Rules for Function Spaces with Unspecified Smoothness and General Weights.
SIAM J. Sci. Comput., August, 2022

Unbiased MLMC Stochastic Gradient-Based Optimization of Bayesian Experimental Designs.
SIAM J. Sci. Comput., 2022

Component-by-component construction of randomized rank-1 lattice rules achieving almost the optimal randomized error rate.
Math. Comput., 2022

A note on concatenation of quasi-Monte Carlo and plain Monte Carlo rules in high dimensions.
J. Complex., 2022

Polynomial tractability for integration in an unweighted function space with absolutely convergent Fourier series.
CoRR, 2022

A universal median quasi-Monte Carlo integration.
CoRR, 2022

Improved bounds on the gain coefficients for digital nets in prime base.
CoRR, 2022

Sub-optimality of Gauss-Hermite quadrature and optimality of trapezoidal rule for functions with finite smoothness.
CoRR, 2022

2021
Toeplitz Monte Carlo.
Stat. Comput., 2021

A simple algorithm for global sensitivity analysis with Shapley effects.
Reliab. Eng. Syst. Saf., 2021

Stability of lattice rules and polynomial lattice rules constructed by the component-by-component algorithm.
J. Comput. Appl. Math., 2021

Efficient debiased evidence estimation by multilevel Monte Carlo sampling.
Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

2020
Multilevel Monte Carlo Estimation of the Expected Value of Sample Information.
SIAM/ASA J. Uncertain. Quantification, 2020

Unbiased MLMC stochastic gradient-based optimization of Bayesian experimental designs.
CoRR, 2020

Efficient Debiased Variational Bayes by Multilevel Monte Carlo Methods.
CoRR, 2020

2019
Richardson Extrapolation of Polynomial Lattice Rules.
SIAM J. Numer. Anal., 2019

Decision-making under uncertainty: using MLMC for efficient estimation of EVPPI.
Stat. Comput., 2019

Lattice rules in non-periodic subspaces of Sobolev spaces.
Numerische Mathematik, 2019

On the separability of multivariate functions.
Math. Comput. Simul., 2019

Multilevel Monte Carlo estimation of log marginal likelihood.
CoRR, 2019

2018
Optimal Order Quadrature Error Bounds for Infinite-Dimensional Higher-Order Digital Sequences.
Found. Comput. Math., 2018

2017
Computing the variance of a conditional expectation via non-nested Monte Carlo.
Oper. Res. Lett., 2017

Construction of interlaced polynomial lattice rules for infinitely differentiable functions.
Numerische Mathematik, 2017

2016
An Explicit Construction of Optimal Order Quasi-Monte Carlo Rules for Smooth Integrands.
SIAM J. Numer. Anal., 2016

Quasi-Monte Carlo integration using digital nets with antithetics.
J. Comput. Appl. Math., 2016

Digital nets with infinite digit expansions and construction of folded digital nets for quasi-Monte Carlo integration.
J. Complex., 2016

2015
Fast construction of higher order digital nets for numerical integration in weighted Sobolev spaces.
Numer. Algorithms, 2015

Good interlaced polynomial lattice rules for numerical integration in weighted Walsh spaces.
J. Comput. Appl. Math., 2015

Constructing good higher order polynomial lattice rules with modulus of reduced degree.
J. Complex., 2015

The b-adic tent transformation for quasi-Monte Carlo integration using digital nets.
J. Approx. Theory, 2015

Construction of Interlaced Scrambled Polynomial Lattice Rules of Arbitrary High Order.
Found. Comput. Math., 2015

2014
The Mean Square Quasi-Monte Carlo Error for Digitally Shifted Digital Nets.
Proceedings of the Monte Carlo and Quasi-Monte Carlo Methods, 2014


  Loading...