Sparse random features improve accuracy in data-scarce settings.
problem Limited accuracy of random feature methods in data-scarce applications.
method Sparse random feature expansion using compressive sensing.
result Improved generalization bounds for sparse random features.
Multivariate splines linked to infinitely-wide neural networks with improved numerical performance.
problem Understanding the relationship between multivariate splines and neural networks.
method Showed multivariate splines can be represented as random features in infinitely-wide neural networks with a homogeneous activation function.
result The function space of multivariate splines is a Sobolev space on a Euclidean ball with explicit norm bounds on derivatives.
New method trains DGP models with random feature expansions for scalable inference.
problem Scalability and inference complexity in Deep Gaussian Processes.
method Random feature expansions combined with stochastic variational inference.
result Significantly advanced inference for Deep Gaussian Processes, scalable to large datasets.
Ensembles dynamic models using random feature approximations.
problem Online scalable Bayesian learning with dynamic models and ensembling.
method Random feature approximations and dynamic models using random walks.
result Better performance with alternative basis expansions like Hilbert space Gaussian processes.
HARFE approximates sparse additive functions using random features and ridge regression.
problem Approximating high-dimensional sparse additive functions.
method Hard-ridge random feature expansion with sparse ridge regression and hard-thresholding pursuit.
result HARFE method converges with a given error bound and achieves lower error than other algorithms.
Enhances random forest performance with exogenous randomness.
problem Improving random forest performance through exogenous randomness.
method Developed non-asymptotic MSE expansions for individual trees and forests, identified two types of randomness, and conducted simulations.
result Exogenous randomness, particularly feature subsampling, reduces both bias and variance of random forests.
Interpretable classifier improves accuracy through probability series expansion.
problem Improving classifier accuracy while maintaining interpretability.
method Directly measures class probabilities from training data, refines predictions through series expansion.
result Achieves comparable accuracy to Random Forests on four datasets.
New method uses sparse random features for crashworthiness analysis.
problem Efficient surrogate modelling for uncertainty quantification.
method Sparse Random Features combined with self-supervised dimensionality reduction.
result Superiority over state-of-the-art techniques in crashworthiness analysis.
We show that kernel-based quadrature rules for computing integrals can be seen as a special case of random feature expansions for positive definite kernels, for a particular decomposition that always exists for such kernels. We provide a theoretical analysis of the number of required samples for a given approximation e…
Study evaluates methods for expanding communities in hypergraphs using random walks.
problem Expanding communities in hypergraphs using random walks.
method Clique-expansion and tensor methods evaluated; hybrid method proposed.
result Parameter regimes identified where methods outperform each other.
Proposes a new method to approximate kernel functions for large datasets.
problem Limited applicability of kernel methods for large scale datasets.
method Pseudo Random Fourier Features (PRFF) for reducing feature dimensions and improving performance.
result Improves prediction performance and reduces feature dimensions compared to RFF.
New method improves Gaussian kernel approximations for high-frequency data.
problem Limited scalability of kernel-based models to large data sets.
method Local random feature approximations using Maclaurin expansions and polynomial sketches.
result Significant improvement in kernel approximations and downstream performance for high-frequency data.
Develops a new feature theory for robust machine learning.
problem Creating robust machine learning features from training data.
method Stochastic tensor space feature theory with Karhunen-Loeve expansion and hierarchical subspaces.
result Dramatic increases in accuracy for predicting Alzheimer's disease stages.
New method uses deep neural networks to interpolate spatiotemporal data.
problem Scalable interpolation of spatiotemporal data from growing earth observation systems.
method Bayesian deep learning with random feature expansions.
result Competitive or superior results compared to existing methods.
BERET improves binary expansion test for multivariate independence.
problem Testing independence of random vectors in arbitrary dimensions.
method Ensemble approach using sum of squared symmetry statistics and distance correlation.
result Improves power while preserving interpretability.
Study improves variance calculation for random zero sets on complex manifolds.
problem Improving the variance calculation for random zero sets on complex manifolds.
method Deriving an asymptotic expansion for the variance of linear statistics of zero divisors of random holomorphic sections.
result Sharpens leading-order asymptotics for the variance of random zero sets.
We propose a scheme for recycling Gaussian random vectors into structured matrices to approximate various kernel functions in sublinear time via random embeddings. Our framework includes the Fastfood construction as a special case, but also extends to Circulant, Toeplitz and Hankel matrices, and the broader family of s…
Random walks on free groups reveal asymmetric expansion factors.
problem Understanding expansion factors in free groups.
method Random walks and BGIP on metric spaces.
result Generic outer automorphisms have different forward and backward expansion factors.
Gaussian equivalence fails for simple polynomial embeddings in quadratic scaling RF models.
problem Failure of Gaussian equivalence in polynomial feature embeddings under quadratic scaling.
method Introduced Conditional Gaussian Equivalent (CGE) model to capture non-Gaussian behavior.
result Correct asymptotics derived for training and test errors in CGE model.
New spatiotemporal Besov process improves CT image reconstruction and other inverse problems.
problem Handling abrupt changes and sharp contrasts in spatiotemporal data.
method Generalized Besov process (STBP) with Q-exponential process for temporal correlation.
result STBP outperforms traditional methods in dynamic reconstruction and inverse problems.
Study on random representations of surface groups into SU(n), focusing on asymptotic expansions.
problem Understanding random representations of surface groups into special unitary groups.
method Use of a symplectic form on moduli space, establishing asymptotic expansions for trace values.
result Existence of large n asymptotic expansions for expected values of trace of elements under random representations.
This paper explains CART random forests using stochastic control theory.
problem Understanding the inner workings of CART random forests.
method Developed a stochastic-control perspective on CART random forests, interpreting feature subsampling as a random feasible action set and the split rule as a policy.
result Established that the CART policy is locally stabilizing but globally suboptimal for the forest objective.
Study shows RFRR's effectiveness with nearly orthogonal data in overparameterized settings.
problem Understanding the effectiveness of random feature regression with nearly orthogonal data.
method Investigates RFRR with nearly orthogonal deterministic unit-length input data vectors in the overparameterized regime.
result Shows high-probability non-asymptotic concentration results for RFRR's training, cross-validation, and generalization errors.
TaylorPODA uses Taylor expansions to improve feature attributions for opaque models.
problem Lack of systematic framework for quantifying feature contributions in opaque models.
method Taylor expansion framework with postulates (precision, federation, zero-discrepancy, adaptation).
result TaylorPODA achieves competitive results and provides principled explanations.
Power-law spectrum of random feature model is preserved in neural networks.
problem Preserving power-law spectrum in neural networks through random feature model.
method Characterized eigenvalues of population random-feature covariance using dyadic head-tail decomposition and Wick chaos expansions.
result Power-law exponent α is inherited from input covariance, modified by a logarithmic correction. The study assesses low-rank approximations in Gaussian Process regression.
problem Improving Gaussian Process regression efficiency with low-rank approximations.
method Analyzes two low-rank approximations: random Fourier features and Mercer expansion truncation.
result Bounds on the divergence and error between exact and approximate GP models.
The study assesses low-rank approximations in Gaussian Process regression.
problem Improving the efficiency of Gaussian Process regression while maintaining accuracy.
method Analyzes two low-rank approximations: random Fourier features and Mercer expansion truncation, and bounds the divergence and error between exact and approximate models.
result Theoretical bounds on the divergence and error between exact and approximate Gaussian Process models are provided.
The study improves volatility model pricing accuracy with new statistical expansions.
problem Improving option pricing accuracy in volatility models.
method Developed Edgeworth expansions for various volatility models.
result Enhanced statistical expansions for volatility models.
Probabilistic model for exhaustion in infinite-genus curve complexes.
problem Action rigidity in infinite-genus curve complexes.
method Costa and Farber's model for random simplicial complexes.
result Probabilistic evidence for exhaustion via rigid expansions.
Paper develops a new kernel expansion method using entropic optimal features for sparse and efficient kernel approximation.
problem Efficient kernel approximation with reduced computational cost and feature dissimilarity.
method Develops a novel optimal design maximizing entropy among kernel features, resulting in a sparse kernel expansion.
result Achieves optimal statistical accuracy with only $O(N^{ rac{1}{4}})$ features, significantly reducing time and space costs.
Study spectral density of neural networks using resolvent method.
problem Investigate spectral density of neural networks with random feature matrices.
method Use resolvent method from random matrix theory, cumulant expansion.
result Impossible to preserve singular value distribution with additive bias.
Kernel mean estimation for functions of random variables provides consistent estimators.
problem Estimating functions of random variables using kernel mean embeddings.
method Kernel mean embeddings for continuous functions of random variables.
result Consistent estimators of mean embeddings of functions of random variables.
Sparse Polynomial Chaos expansions improve accuracy and efficiency in simulations.
problem Challenges in computational efficiency and accuracy for Polynomial Chaos modeling.
method Sparse Bayesian learning using Variational Relevance Vector Machines.
result Sparse Polynomial Chaos expansions achieve comparable performance to compressive sensing with fewer data points.
GP-DRF model handles variable-sized input and learns deep features.
problem Scaling deep Gaussian processes for variable-sized data.
method GP-DRF model combining GPs and DRF layers for efficient inference.
result GP-DRF outperforms standard GP and DRF models across various datasets.
Geodesic random walks in Riemannian manifolds analyzed for large deviations.
problem Analyzing large deviations for geodesic random walks in Riemannian manifolds.
method Direct proof of Cramér's theorem, exploiting vector space structure, Taylor expansions, and parallel transport.
result Obtained the analogue of Cramér's theorem for geodesic random walks.
Proposes AMS-SFE to improve zero-shot learning by aligning semantic feature spaces.
problem Domain shift problem in zero-shot learning due to disjoint seen and unseen data.
method Expands semantic features using an autoencoder and aligns them with visual feature manifold.
result Remarkable performance improvement over existing methods.
We investigate the analogy between the large N expansion in normal matrix models and the asymptotic expansion of the determinant of the Hilb map, appearing in the study of critical metrics on complex manifolds via projective embeddings. This analogy helps to understand the geometric meaning of the expansion of matrix m…
Neural networks solve SPDEs using Wiener chaos expansion.
problem Solving stochastic partial differential equations (SPDEs) numerically.
method Using neural networks in the truncated Wiener chaos expansion.
result Approximation rates for learning SPDE solutions with noise.
Framework aligns datasets using harmonic expansion of intrinsic geometry.
problem Combining datasets from different modalities or correcting batch effects.
method Alignment through harmonic expansion of diffusion coordinates.
result Unified diffusion geometry for fused or corrected data.
New sampling method for Heston model reduces complexity.
problem Efficient sampling for Heston model's time integrated variance.
method Series expansion, change of measure, Chebyshev polynomial approximations.
result Strong, efficient sampling scheme established for Heston model.
Paper extracts features from time series to improve forecasting accuracy.
problem Forecasting time series generated by Itô-type processes with unknown coefficients.
method Statistical adjustment of mixture-type models to extract features from time series data.
result Additional statistical features enhance time series prediction accuracy.
RSHT algorithm simplifies complex shapes to points.
problem Simplifying complex shapes to points in higher dimensions.
method Combines simplicial collapses and expansions.
result Reduces triangulated d-manifolds to points using RSHT.
Detects anomalies in vector fields without distributional assumptions.
problem Detecting anomalies in high-dimensional, non-stationary vector fields.
method Optimal Karhunen-Loeve expansion, multilevel orthogonal subspaces, hypothesis tests.
result Reliable anomaly detection without distributional assumptions.
We introduce closed-form transition density expansions for multivariate affine jump-diffusion processes. The expansions rely on a general approximation theory which we develop in weighted Hilbert spaces for random variables which possess all polynomial moments. We establish parametric conditions which guarantee existen…
Geometric quantization results for Riemann surfaces with semi-positive line bundles.
problem Analyzing geometric quantization for Riemann surfaces with semi-positive line bundles.
method Exploring the Bergman kernel expansion and related results for induced Fubini-Study metrics, Toeplitz operators, and holomorphic torsion.
result Asymptotic results for holomorphic torsion and random sections.
In graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and prove that similar connections exist between the combinatorial expansion of a compl…
Paper tackles high-order inference in structured prediction tasks.
problem Maximizing a score function on the space of labels in high-order Markov random fields.
method Generative model approach with two-stage convex optimization algorithm.
result Success in general high-order inference problems driven by hyperedge expansion properties.
A new method combines SciML and UQ with physical constraints.
problem Uncertainty quantification in scientific machine learning tasks.
method Physics-constrained polynomial chaos expansion.
result Effective uncertainty quantification and SciML integration.