scientific article
From MaRDI portal
Publication:3093333
zbMath1222.68186MaRDI QIDQ3093333
Michael W. Mahoney, Petros Drineas
Publication date: 12 October 2011
Full work available at URL: http://www.jmlr.org/papers/v6/drineas05a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (82)
Randomized numerical linear algebra: Foundations and algorithms ⋮ Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA ⋮ Non-asymptotic properties of spectral decomposition of large Gram-type matrices and applications ⋮ Accuracy of suboptimal solutions to kernel principal component analysis ⋮ Column subset selection problem is UG-hard ⋮ An approximate linear solver in least square support vector machine using randomized singular value decomposition ⋮ Optimal Quadrature-Sparsification for Integral Operator Approximation ⋮ Reduced-Dimensional Monte Carlo Maximum Likelihood for Latent Gaussian Random Field Models ⋮ A randomized algorithm for a tensor-based generalization of the singular value decomposition ⋮ Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format ⋮ Canonical kernel dimension reduction ⋮ Randomized approximate class-specific kernel spectral regression analysis for large-scale face verification ⋮ Nyström landmark sampling and regularized Christoffel functions ⋮ Far-field compression for fast kernel summation methods in high dimensions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Iterative ensemble normalized cuts ⋮ Beam search algorithms for multilabel learning ⋮ Fast Deterministic Approximation of Symmetric Indefinite Kernel Matrices with High Dimensional Datasets ⋮ Randomized generalized singular value decomposition ⋮ Large-scale eigenvector approximation via Hilbert space embedding Nyström ⋮ Privacy preserving feature selection and multiclass classification for horizontally distributed data ⋮ Low-rank decomposition meets kernel learning: a generalized Nyström method ⋮ Large scale variable fidelity surrogate modeling ⋮ Asymptotic error bounds for kernel-based Nyström low-rank approximation matrices ⋮ Nyström-based approximate kernel subspace learning ⋮ Modified Cheeger and ratio cut methods using the Ginzburg–Landau functional for classification of high-dimensional data ⋮ Using an iterative linear solver in an interior-point method for generating support vector machines ⋮ On convergence rates of adaptive ensemble Kalman inversion for linear ill-posed problems ⋮ A literature survey of matrix methods for data science ⋮ Near-optimal coresets of kernel density estimates ⋮ Randomized Low-Rank Approximation for Symmetric Indefinite Matrices ⋮ Fast density-weighted low-rank approximation spectral clustering ⋮ Linear-Cost Covariance Functions for Gaussian Random Fields ⋮ Optimal Reaction Coordinates: Variational Characterization and Sparse Computation ⋮ Training very large scale nonlinear SVMs using alternating direction method of multipliers coupled with the hierarchically semi-separable kernel approximations ⋮ Unnamed Item ⋮ HODLR\(d\)D: a new black-box fast algorithm for \(N\)-body problems in \(d\)-dimensions with guaranteed error bounds. Applications to integral equations and support vector machines ⋮ A memory-free spatial additive mixed modeling for big spatial data ⋮ Efficient kernel canonical correlation analysis using Nyström approximation ⋮ Sparse Gaussian processes for solving nonlinear PDEs ⋮ Literature survey on low rank approximation of matrices ⋮ Optimal CUR Matrix Decompositions ⋮ Exemplar-based low-rank matrix decomposition for data clustering ⋮ Unnamed Item ⋮ Multiple Spectral Kernel Learning and a Gaussian Complexity Computation ⋮ Optimized fixed-size kernel models for large data sets ⋮ Near-optimal discrete optimization for experimental design: a regret minimization approach ⋮ Self-Assignment Flows for Unsupervised Data Labeling on Graphs ⋮ Analytical Low-Rank Compression via Proxy Point Selection ⋮ Exact and efficient top-\(K\) inference for multi-target prediction by querying separable linear relational models ⋮ Kernel embedding based variational approach for low-dimensional approximation of dynamical systems ⋮ Robust low-rank multiple kernel learning with compound regularization ⋮ On the Numerical Rank of Radial Basis Function Kernels in High Dimensions ⋮ Unnamed Item ⋮ Stochastic Subgradient Estimation Training for Support Vector Machines ⋮ The Nyström minimum kernel risk-sensitive loss algorithm with \(k\)-means sampling ⋮ The kernel Kalman rule. Efficient nonparametric inference by recursive least-squares and subspace projections ⋮ Fast Entropic Regularized Optimal Transport Using Semidiscrete Cost Approximation ⋮ Block Basis Factorization for Scalable Kernel Evaluation ⋮ New efficient algorithms for multiple change-point detection with reproducing kernels ⋮ Diffuse Interface Models on Graphs for Classification of High Dimensional Data ⋮ Unnamed Item ⋮ Perspectives on CUR decompositions ⋮ A scalable gaussian process analysis algorithm for biomass monitoring ⋮ A Computationally Efficient Projection-Based Approach for Spatial Generalized Linear Mixed Models ⋮ Scalable Gaussian Process Computations Using Hierarchical Matrices ⋮ Randomized signal processing with continuous frames ⋮ Triply stochastic gradient method for large-scale nonlinear similar unlabeled classification ⋮ Variable prioritization in nonlinear black box methods: a genetic association case study ⋮ Scalable Gaussian kernel support vector machines with sublinear training time complexity ⋮ Sparse hierarchical regression with polynomials ⋮ Unnamed Item ⋮ Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning ⋮ Extreme entropy machines: robust information theoretic classification ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Perturbations of CUR Decompositions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Approximate kernel PCA: computational versus statistical trade-off ⋮ Unconfused ultraconservative multiclass algorithms
This page was built for publication:
