RECORD
Derandomised lattice rules for high dimensional integration
Numerical Analysis · Submitted 12 Mar 2019
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim We show, by applying the principle that \emph{there is always at least one choice as good as the average}, that for a given generating vector there exists a half-shifted rule whose squared worst-case error differs from the shift-averaged squared worst-case error by a term of order only ${1/N^2}$.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
We seek shifted lattice rules that are good for high dimensional integration over the unit cube in the setting of an unanchored weighted Sobolev space of functions with square-integrable mixed first derivatives. Many existing studies rely on random shifting of the lattice, whereas here we work with lattice rules with a deterministic shift. Specifically, we consider "half-shifted" rules, in which each component of the shift is an odd multiple of $1/(2N)$, where $N$ is the number of points in the lattice. We show, by applying the principle that \emph{there is always at least one choice as good as the average}, that for a given generating vector there exists a half-shifted rule whose squared worst-case error differs from the shift-averaged squared worst-case error by a term of order only ${1/N^2}$. Numerical experiments, in which the generating vector is chosen component-by-component (CBC) as for randomly shifted lattices and then the shift by a new "CBC for shift" algorithm, yield encouraging results.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | We seek shifted lattice rules that are good for high dimensional integration over the unit cube in the setting of an unanchored weighted Sobolev space of functions with square-integrable mixed first derivatives. | background 0.66 | 0.32 | 0.04 | asserted 0.61 |
| s1 | Many existing studies rely on random shifting of the lattice, whereas here we work with lattice rules with a deterministic shift. | background 0.48 | 0.55 | 0.04 | asserted 0.99 |
| s2 | Specifically, we consider "half-shifted" rules, in which each component of the shift is an odd multiple of $1/(2N)$, where $N$ is the number of points in the lattice. | method 0.74 | 0.52 | 0.03 | asserted 0.97 |
| s3 | We show, by applying the principle that \emph{there is always at least one choice as good as the average}, that for a given generating vector there exists a half-shifted rule whose squared worst-case error differs from the shift-averaged squared worst-case error by a term of order only ${1/N^2}$. | result 0.96 | 0.93 | 0.72 | asserted 1.00 |
| s4 | Numerical experiments, in which the generating vector is chosen component-by-component (CBC) as for randomly shifted lattices and then the shift by a new "CBC for shift" algorithm, yield encouraging results. | result 0.56 | 0.94 | 0.10 | asserted 0.61 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
We seek shifted lattice rules that are good for high dimensional integration over the unit cube in the setting of an unanchored weighted Sobolev space of functions with square-integrable mixed first derivatives. Many existing studies rely on random shifting of the lattice, whereas here we work with lattice rules with a deterministic shift. Specifically, we consider "half-shifted" rules, in which each component of the shift is an odd multiple of $1/(2N)$, where $N$ is the number of points in the lattice. We show, by applying the principle that \emph{there is always at least one choice as good as the average}, that for a given generating vector there exists a half-shifted rule whose squared worst-case error differs from the shift-averaged squared worst-case error by a term of order only ${1/N^2}$. Numerical experiments, in which the generating vector is chosen component-by-component (CBC) as for randomly shifted lattices and then the shift by a new "CBC for shift" algorithm, yield encouraging results.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.