Co-occurring keywords · papers mentioning both
Papers
A Nonconvex Projection Method for Robust PCA
AAAI 2019
Computation Efficient Coded Linear Transform
AISTATS 2019
Double Viterbi: Weight Encoding for High Compression Ratio and Fast On-Chip Reconstruction for Deep Neural Network
ICLR 2019
High-dimensional Varying Index Coefficient Models via Stein's Identity
JMLR 2019
Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizations
ICML 2019
Robust Principal Component Analysis-Based Infrared Small Target Detection
AAAI 2019
Scalable Interpretable Multi-Response Regression via SEED
JMLR 2019
Matrix completability analysis via graph k-connectivity
AISTATS 2018
Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order
ICML 2018
Metadata-dependent Infinite Poisson Factorization for Efficiently Modelling Sparse and Large Matrices in Recommendation
IJCAI 2018
Viterbi-based Pruning for Sparse Matrix with Fixed and High Index Compression Ratio
ICLR 2018
Hierarchical Feature Selection with Recursive Regularization
IJCAI 2017
Learning Overcomplete HMMs
NeurIPS 2017
Speeding Up Latent Variable Gaussian Graphical Model Estimation via Nonconvex Optimization
NeurIPS 2017
Thy Friend is My Friend: Iterative Collaborative Filtering for Sparse Matrix Estimation
NeurIPS 2017
A Subspace Learning Approach for High Dimensional Matrix Decomposition with Efficient Column/Row Sampling
ICML 2016
Convex Block-sparse Linear Regression with Expanders – Provably
AISTATS 2016
Dimensionality Reduction of Massive Sparse Datasets Using Coresets
NeurIPS 2016
High Dimensional Structured Superposition Models
NeurIPS 2016
Model-based Co-clustering for High Dimensional Sparse Data
AISTATS 2016
Simultaneous Pursuit of Sparseness and Rank Structures for Matrix Decomposition
JMLR 2015
Sparse and Low-Rank Tensor Decomposition
NeurIPS 2015
Sparse Dueling Bandits
AISTATS 2015
Incremental Block Cholesky Factorization for Nonlinear Least Squares in Robotics
RSS 2013
Intersecting singularities for multi-structured estimation
ICML 2013