Papers › The Global Active Subspace Method

The Global Active Subspace Method

28 Mar 2023arXiv:2304.14142links table onlyarchive 2025-07-28

Ruilong Yue, Giray Ökten

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

We present a new dimension reduction method called the global active subspace method. The method uses expected values of finite differences of the underlying function to identify the important directions, and builds a surrogate model using the important directions on a lower dimensional subspace. The method is a generalization of the active subspace method which uses the gradient information of the function to construct a reduced model. We develop the error analysis for the global active subspace method, and present examples to compare it with the active subspace method numerically. The results show that the global active subspace method is accurate, efficient, and robust with respect to noise or lack of smoothness in the underlying function.

PaperPDFCode

Code

ruilongyue/global-active-subspace officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections