Grouped Transformations and Regularization in High-Dimensional Explainable ANOVA Approximation
From MaRDI portal
Publication:5084523
DOI10.1137/20M1374547OpenAlexW3213753448WikidataQ114074140 ScholiaQ114074140MaRDI QIDQ5084523
Daniel Potts, M. Schmischke, Felix Bartel
Publication date: 24 June 2022
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.10199
group Lassohigh-dimensional approximationLSQRmultivariate trigonometric polynomialsanalysis of variance (ANOVA)fast iterative shrinkage-thresholding algorithm (FISTA)explainable approximationnonequispaced fast Fourier transform (NFFT)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Tikhonov, Ivanov and Morozov regularization for support vector machine learning
- Sparse high-dimensional FFT based on rank-1 lattice sampling
- Sparse grid quadrature in high dimensions with applications in finance and insurance
- Liberating the dimension for function approximation
- Approximation of functions of few variables in high dimensions
- Dimension-wise integration of high-dimensional functions with applications to finance
- Fast cross-validation in harmonic approximation
- General foundations of high-dimensional model representations
- Numerical Fourier analysis
- Infinite-dimensional integration and the multivariate decomposition method
- Worst-case recovery guarantees for least squares approximation using random samples
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
- Learning multivariate functions with low-dimensional structures using polynomial bases
- Reconstructing Hyperbolic Cross Trigonometric Polynomials by Sampling along Rank-1 Lattices
- Counting Via Entropy: New Preasymptotics for the Approximation Numbers of Sobolev Embeddings
- The ANOVA decomposition of a non-smooth function of infinitely many variables can have every term smooth
- Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
- On decompositions of multivariate functions
- The Group Lasso for Logistic Regression
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Effective Dimension of Some Weighted Pre-Sobolev Spaces with Dominating Mixed Partial Derivatives
- Efficient Implementations of the Multivariate Decomposition Method for Approximating Infinite-Variate Integrals
- Probabilistic Sensitivity Analysis of Complex Models: A Bayesian Approach
- Function integration, reconstruction and approximation using rank-$1$ lattices
- Interpretable Approximation of High-Dimensional Data
- Approximation of High-Dimensional Periodic Functions with Fourier-Based Methods
- Optimal Randomized Multilevel Algorithms for Infinite-Dimensional Integration on Function Spaces with ANOVA-Type Decomposition
- Fast Discrete Fourier Transform on Generalized Sparse Grids
- Sparse grids
- Model Selection and Estimation in Regression with Grouped Variables
- Estimating Mean Dimensionality of Analysis of Variance Decompositions
- Global sensitivity indices for nonlinear mathematical models and their Monte Carlo estimates
