Quantum computers can enhance spectral methods in machine learning.
problem Spectral methods are fundamental but challenging for classical models.
method Utilizing quantum Fourier Transform for spectral manipulations.
result Quantum computing can offer more efficient spectral design.
Bayesian parametric matrix models provide uncertainty quantification for spectral learning.
problem Uncertainty quantification in spectral learning for safety-critical applications.
method Bayesian parametric matrix models (B-PMMs) that extend PMMs to provide uncertainty estimates.
result B-PMMs achieve exceptional uncertainty calibration (ECE < 0.05) while maintaining favorable scaling.
Spectral deconfounding improves machine learning models by reducing hidden confounding effects.
problem Machine learning models can be misled by hidden confounders, leading to unreliable predictions.
method Develops a nonlinear spectral deconfounding framework for gradient boosting that modifies boosting dynamics to slow down in confounding-aligned directions.
result Spectrally deconfounded boosting improves estimation of the target function under hidden confounding and is more scalable.
Graph Laplacians and machine learning predict properties of finite graphs.
problem Understanding properties of finite graphs using spectral and topological methods.
method Combining graph Laplacians, spectral inequalities, machine learning, and topological data analysis.
result Neural networks can accurately predict graph properties like Ricci-flatness and spectral gaps.
Learning meaningful graphs from data plays important roles in many data mining and machine learning tasks, such as data representation and analysis, dimension reduction, data clustering, and visualization, etc. In this work, for the first time, we present a highly-scalable spectral approach (GRASPEL) for learning large…
New spectral mixture representation for isotropic kernels simplifies random Fourier features.
problem Applying Random Fourier Features to complex kernels.
method Decompose isotropic kernels into scale mixtures of α-stable random vectors.
result Constructive spectral sampling formula for various kernels.
New equivariant filters improve graph classification.
problem Designing deep learning models for graph symmetries.
method Nonlinear spectral filters (NLSFs) that are equivariant to graph functional shifts.
result NLSFs outperform existing spectral GNNs in graph classification.
New machine learning method classifies companies effectively.
problem Classifying companies for financial analysis.
method Unsupervised machine learning with t-SNE and spectral clustering.
result Improved portfolio performance through better company classification.
A central area of research in nonlinear science is the study of instabilities that drive the emergence of extreme events. Unfortunately, experimental techniques for measuring such phenomena often provide only partial characterization. For example, real-time studies of instabilities in nonlinear fibre optics frequently …
SML improves pancreatic mass diagnosis accuracy using CT images.
problem Improving accuracy in pancreatic mass screening using CT imaging.
method Spectral machine learning method trained on 30,000 images, choosing fundamental images based on eigenvectors and removing irrelevant pixels.
result Achieved 94.6% test accuracy in diagnosing 113 patients.
Galerkin method outperforms graph-based methods in spectral decompositions.
problem Improving spectral decomposition methods in machine learning.
method Restricting study to a small set of test functions using the Galerkin method.
result Statistical and computational superiority of Galerkin method over graph-based approaches.
New method trains neural networks in spectral domain for improved performance.
problem Training deep neural networks in the space of nodes.
method Trains neural networks in the spectral domain, modifying eigenvalues and eigenvectors of transfer operators.
result Superior performance compared to standard methods, especially when adjusting eigenvalues.
New method extrapolates spectral densities from smaller models to larger ones.
problem Limited practical computations for large machine learning models.
method Algebraic spectral curve theory for free decompression.
result Framework enables extrapolation of spectral densities with multiple or multi-modal bulks.
New kernels capture both local and non-local interactions efficiently.
problem Designing kernels that capture both local and non-local interactions while remaining computationally tractable.
method Spectral truncation kernels based on C∗-algebra. result Spectral truncation kernels induce interactions across the data function domain and reduce computational cost.
This paper improves spectral clustering for large datasets using the Nystrom method.
problem Spectral clustering's scalability issues with large datasets.
method A principled spectral clustering algorithm exploiting Nystrom approximation's spectral properties.
result Improved spectral clustering efficiency and accuracy compared to existing methods.
In machine learning, a nonparametric forecasting algorithm for time series data has been proposed, called the kernel spectral hidden Markov model (KSHMM). In this paper, we propose a technique for short-term wind-speed prediction based on KSHMM. We numerically compared the performance of our KSHMM-based forecasting tec…
Graph convolutional networks fail to use eigenvectors beyond the first, unlike spectral embedding.
problem Understanding when graph convolutional networks fail compared to spectral embedding.
method Presented a simple generative model to illustrate failure.
result Graph convolutional networks fail to use eigenvectors beyond the first in certain graphs.
A large number of algorithms in machine learning, from principal component analysis (PCA), and its non-linear (kernel) extensions, to more recent spectral embedding and support estimation methods, rely on estimating a linear subspace from samples. In this paper we introduce a general formulation of this problem and der…
In many areas of machine learning, it becomes necessary to find the eigenvector decompositions of large matrices. We discuss two methods for reducing the computational burden of spectral decompositions: the more venerable Nystom extension and a newly introduced algorithm based on random projections. Previous work has c…
A new metric compares dynamical systems using operator eigenvalues.
problem Comparing and interpolating nonlinear dynamical systems from trajectory data.
method Representing systems as distributions of operator eigenvalues and projectors, defining a spectral-Grassmann Wasserstein metric.
result The proposed metric outperforms standard operator-based distances in machine learning applications.
This study bridges the gap between spatial and spectral GNNs.
problem Lack of direct comparison and cross-reference of existing GNNs.
method Systematically categorizes and examines GNNs into spatial and spectral domains.
result Establishes a strong relationship between spatial and spectral GNNs.
Self-distillation optimally improves model performance in spiked covariance models.
problem Improving model performance in spiked covariance models.
method Developed spectral shrinkage estimators and analyzed self-distillation.
result Self-distillation achieves optimal performance among spectral shrinkage estimators for spiked covariance matrices.
Graph Laplacians adapt to different manifold dimensions, while Dirichlet energies converge to a tensorized Dirichlet energy.
problem Understanding machine learning methods for data with varying intrinsic dimensions.
method Γ-convergence of graph Dirichlet energies and spectral convergence of graph Laplacians on intersecting manifolds of varying dimensions.
result Normalized Dirichlet energy converges to a tensorized Dirichlet energy that adapts to all dimensions simultaneously.
Paper explores SNN for learning spectral geometric info from data.
problem Challenges in applying traditional eigensolvers to big data.
method Introduces Spectral Neural Networks (SNN) as an alternative.
result Investigates tradeoffs and optimization landscape of SNN.
Spectral methods simplify data analysis, improving accuracy and stability.
problem Extracting meaningful information from noisy, incomplete data.
method Eigenvalues and eigenvectors of matrices constructed from data.
result Spectral methods are effective and can be analyzed using modern statistical theory.
Nystrom approximation speeds up kernel model training.
problem Slow convergence in kernel models due to poor conditioning.
method Spectral preconditioning with Nystrom approximation for scalability.
result Nystrom approximation accelerates gradient descent nearly as well as exact preconditioner.
In the past decades, spectral clustering (SC) has become one of the most effective clustering algorithms. However, most previous studies focus on spectral clustering tasks with a fixed task set, which cannot incorporate with a new spectral clustering task without accessing to previously learned tasks. In this paper, we…
Study reveals how spectral bias affects learnability on real-world data.
problem Understanding how well complex datasets can be learned using kernel methods.
method Use eigenvalues and eigenfunctions from idealized data to reveal spectral bias on real-world data.
result Bound learnability on real-world data using symmetries of realistic kernels.
Spectral regularization improves learning over combinatorial spaces with limited data.
problem Learning pseudo-Boolean functions with scarce labeled data.
method Regularizing the spectral representation of learned functions using the L_1 norm.
result Regularization allows for data-frugal learning and achieves statistically optimal generalization performance.
Develops precise expressions for random projections for better machine learning tasks.
problem Improving the accuracy of dimensionality reduction in machine learning tasks.
method Exploits recent developments in spectral analysis of random matrices to derive accurate expressions for random projection matrices.
result Provides precise expressions that reflect the practical performance of sketching methods, including Gaussian and Rademacher sketches.
Deep neural networks correct Mie scattering in FTIR spectra of biological samples.
problem Mie scattering obscures biochemically relevant spectral information in FTIR spectra of biological samples.
method Deep neural networks to approximate the preprocessing function that removes Mie scattering.
result The model is faster and more generalizable across different tissue types.
Introduces Spectral Graph Network combining spatial and spectral message passing.
problem Relational reasoning in graph structured data.
method Applies message passing to both spatial and spectral domains of a graph.
result Promotes efficient training with fewer iterations and robustness to edge dropout.
This paper refines understanding of decentralized learning by considering graph topology.
problem Current theory fails to predict performance in decentralized learning settings.
method Quantifies how graph topology influences convergence in decentralized learning.
result Graph topology significantly impacts convergence in decentralized learning, contrary to spectral gap theory.
Improves regression models' performance on covariate shift.
problem Out-of-distribution generalization for regression.
method Spectrally adapting the weights of a pre-trained neural regression model.
result Spectral adaptation improves out-of-distribution performance.
SPECTRE defends against backdoor attacks by amplifying corrupted data's spectral signature.
problem Backdoor attacks that change model behavior with specific triggers.
method Robust covariance estimation to amplify spectral signature of poisoned data.
result Clean model is completely removed from backdoor, even in hard-to-detect cases.
Estimates intrinsic dimension of data sets robustly to noise.
problem Estimating intrinsic dimension of noisy data sets.
method Quantum Cognition Machine Learning for data representation and spectral gap detection.
result Robust estimation of intrinsic dimension in the presence of Gaussian noise.
Hypergraphs are used in machine learning to model higher-order relationships in data. While spectral methods for graphs are well-established, spectral theory for hypergraphs remains an active area of research. In this paper, we use random walks to develop a spectral theory for hypergraphs with edge-dependent vertex wei…
Machine learning helps predict smoke types for safer forest burns.
problem Determining which fuels to burn safely to reduce wildfire risk and minimize smoke.
method Machine learning techniques like spectral clustering and manifold learning.
result Interpretable representations and tools for differentiating smoke types.
New framework explains diverse impacts of data augmentation.
problem Understanding the varied effects of data augmentation on model performance.
method Developed a theoretical framework to characterize DA's impact on linear models.
result Data augmentation induces implicit spectral regularization through two effects.
Optimizes learning Hilbert-Schmidt operators between Sobolev spaces.
problem Statistical limits of learning mappings between infinite-dimensional function spaces.
method Minimax optimal regularization and multilevel training.
result Multilevel kernel operator learning achieves optimal learning rate.
A large class of machine learning techniques requires the solution of optimization problems involving spectral functions of parametric matrices, e.g. log-determinant and nuclear norm. Unfortunately, computing the gradient of a spectral function is generally of cubic complexity, as such gradient descent methods are rath…
Spectral algorithms solve optimal community detection and related problems.
problem Optimal detection of community structures and related substructures.
method Spectral algorithms applied to various planted substructures.
result Spectral algorithms achieve optimal performance for a wide range of planted substructures.
OpinionRank uses graph-based ranking to improve unreliable crowdsourced labels.
problem Improving trustworthiness of crowdsourced labels for machine learning.
method Graph-based spectral ranking to integrate unreliable labels.
result OpinionRank outperforms conventional algorithms in reliability and scalability.
We derive analytical expressions for the generalization performance of kernel regression as a function of the number of training samples using theoretical methods from Gaussian processes and statistical physics. Our expressions apply to wide neural networks due to an equivalence between training them and kernel regress…
Sign equivariant networks improve model expressiveness for spectral geometric learning.
problem Limited expressiveness of sign invariant models for tasks like graph link prediction.
method Developed sign equivariant neural network architectures based on new analytic sign equivariant polynomials.
result Sign equivariant models achieve theoretical benefits in spectral geometric learning tasks.
This work analyzes how different layers in deep neural networks contribute to generalization error.
problem Understanding the role of each layer in deep neural networks for generalization.
method Spectral analysis, Neural Tangent Kernel, Hermite polynomials, Spherical Harmonics.
result Initial layers in deep neural networks have a larger bias towards high-frequency functions.
This paper proposes a spectral clustering algorithm for hyperbolic spaces, improving efficiency over Euclidean methods.
problem Inefficient clustering in Euclidean spaces for complex data structures.
method Developed a spectral clustering algorithm using hyperbolic similarity matrices.
result The algorithm converges at least as fast as Euclidean spectral clustering and performs better on complex datasets.
Due to the growing ubiquity of unlabeled data, learning with unlabeled data is attracting increasing attention in machine learning. In this paper, we propose a novel semi-supervised kernel learning method which can seamlessly combine manifold structure of unlabeled data and Regularized Least-Squares (RLS) to learn a ne…