Takashi Goda
Orcid: 0000-0001-6055-8055
According to our database1,
Takashi Goda
authored at least 45 papers
between 2014 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
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
2023
Suboptimality of Gauss-Hermite Quadrature and Optimality of the Trapezoidal Rule for Functions with Finite Smoothness.
SIAM J. Numer. Anal., June, 2023
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
J. Comput. Appl. Math., 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
Sub-optimality of Gauss-Hermite quadrature and optimality of trapezoidal rule for functions with finite smoothness.
CoRR, 2022
2021
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
Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021
2020
SIAM/ASA J. Uncertain. Quantification, 2020
Unbiased MLMC stochastic gradient-based optimization of Bayesian experimental designs.
CoRR, 2020
2019
Stat. Comput., 2019
Numerische Mathematik, 2019
2018
Optimal Order Quadrature Error Bounds for Infinite-Dimensional Higher-Order Digital Sequences.
Found. Comput. Math., 2018
2017
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
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
J. Approx. Theory, 2015
Construction of Interlaced Scrambled Polynomial Lattice Rules of Arbitrary High Order.
Found. Comput. Math., 2015
2014
Proceedings of the Monte Carlo and Quasi-Monte Carlo Methods, 2014