Co-occurring keywords · papers mentioning both
Papers
Efficient Spectrum-Revealing CUR Matrix Decomposition
AISTATS 2020
Eliminating the Invariance on the Loss Landscape of Linear Autoencoders
ICML 2020
Error Estimation for Sketched SVD via the Bootstrap
ICML 2020
Fast Adaptively Weighted Matrix Factorization for Recommendation with Implicit Feedback
AAAI 2020
Gromov-Wasserstein Factorization Models for Graph Clustering
AAAI 2020
Implicit Regularization in Deep Learning May Not Be Explainable by Norms
NeurIPS 2020
Inertial Block Proximal Methods for Non-Convex Non-Smooth Optimization
ICML 2020
Input-Sparsity Low Rank Approximation in Schatten Norm
ICML 2020
Interpretable Multimodal Learning for Intelligent Regulation in Online Payment Systems
IJCAI 2020
Kernel and Rich Regimes in Overparametrized Models
COLT 2020
LadaBERT: Lightweight Adaptation of BERT through Hybrid Model Compression
COLING 2020
Layerwise Sparse Coding for Pruned Deep Neural Networks with Extreme Compression Ratio
AAAI 2020
Learning Data-adaptive Non-parametric Kernels
JMLR 2020
Learning Feature Sparse Principal Subspace
NeurIPS 2020
Matrix Inference and Estimation in Multi-Layer Models
NeurIPS 2020
Minimax Rank-$1$ Matrix Factorization
AISTATS 2020
Non-Rigid Structure from Motion: Prior-Free Factorization Method Revisited
WACV 2020
On the Equivalence between Positional Node Embeddings and Structural Graph Representations
ICLR 2020
Optimal Estimation of Sparse Topic Models
JMLR 2020
Population Location and Movement Estimation through Cross-domain Data Analysis
IJCAI 2020
Provable Convex Co-clustering of Tensors
JMLR 2020
Provable Online CP/PARAFAC Decomposition of a Structured Tensor via Dictionary Learning
NeurIPS 2020
Rank and run-time aware compression of NLP Applications
EMNLP 2020
Rethinking Topic Modelling: From Document-Space to Term-Space
EMNLP 2020
Revisiting Bilinear Pooling: A Coding Perspective
AAAI 2020