Co-occurring keywords · papers mentioning both
Papers
Improving Dual-Encoder Training through Dynamic Indexes for Negative Mining
AISTATS 2023
Nyström M-Hilbert-Schmidt independence criterion
UAI 2023
Accelerated Linearized Laplace Approximation for Bayesian Deep Learning
NeurIPS 2022
Efficient Kernelized UCB for Contextual Bandits
AISTATS 2022
Statistical Optimality and Computational Efficiency of Nystrom Kernel PCA
JMLR 2022
Generalization Properties of hyper-RKHS and its Applications
JMLR 2021
Scalable Kernel K-Means Clustering with Nystrom Approximation: Relative-Error Bounds
JMLR 2019
Efficient and principled score estimation with Nyström kernel exponential families
AISTATS 2018
Optimal Rates of Sketched-regularized Algorithms for Least-Squares Regression over Hilbert Spaces
ICML 2018
Beyond the Nystrom Approximation: Speeding up Spectral Clustering using Uniform Sampling and Weighted Kernel k-means
IJCAI 2017
Deep Learning in Semantic Kernel Spaces
ACL 2017
Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data
NeurIPS 2017
Recursive Sampling for the Nystrom Method
NeurIPS 2017
Computationally Efficient Nyström Approximation using Fast Transforms
ICML 2016
Less is More: Nyström Computational Regularization
NeurIPS 2015
Fast Prediction for Large-Scale Kernel Machines
NeurIPS 2014
Approximate Inference in Continuous Determinantal Processes
NeurIPS 2013
Improving CUR Matrix Decomposition and the Nystrom Approximation via Adaptive Sampling
JMLR 2013
Nyström Approximation for Large-Scale Determinantal Processes
AISTATS 2013
A Scalable CUR Matrix Decomposition Algorithm: Lower Time Complexity and Tighter Bound
NeurIPS 2012
A novel greedy algorithm for Nyström approximation
AISTATS 2011