NeurIPS 2017 accepted papers on Learning theory and algorithms
188 of the 688 papers accepted at NeurIPS 2017 (27.3%) are on Learning theory and algorithms, compared with 30.2% at NeurIPS 2016. They fall into 9 topics.
See NeurIPS 2017 in the interactive map
Submitting to NeurIPS? Checklist →
Working on something in this area? Describe your idea in scime atlas to see the closest papers by meaning and how crowded the spot has become.
Topics and papers
Matrix and tensor methods · 45 papers
- Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication (382 citations)
- Learning Koopman Invariant Subspaces for Dynamic Mode Decomposition (78 citations)
- Zap Q-Learning (42 citations)
- The Unreasonable Effectiveness of Structured Random Orthogonal Embeddings (39 citations)
- Fast, Sample-Efficient Algorithms for Structured Phase Retrieval (35 citations)
- On Tensor Train Rank Minimization : Statistical Efficiency and Scalable Algorithm (32 citations)
- Thy Friend is My Friend: Iterative Collaborative Filtering for Sparse Matrix Estimation (26 citations)
- Convergence of Gradient EM on Multi-component Mixture of Gaussians (25 citations)
- Robust Estimation of Neural Signals in Calcium Imaging (25 citations)
- Mixture-Rank Matrix Approximation for Collaborative Filtering (24 citations)
- SVD-Softmax: Fast Softmax Approximation on Large Vocabulary Neural Networks (24 citations)
- Unbiased estimates for linear regression via volume sampling (24 citations)
and 33 more in the interactive map.
Prediction and decision losses · 38 papers
- LightGBM: A Highly Efficient Gradient Boosting Decision Tree (9,433 citations)
- Optimized Pre-Processing for Discrimination Prevention (386 citations)
- Resurrecting the sigmoid in deep learning through dynamical isometry: theory and practice (144 citations)
- Learning Active Learning from Data (138 citations)
- Positive-Unlabeled Learning with Non-Negative Risk Estimator (136 citations)
- Sobolev Training for Neural Networks (111 citations)
- Deep Lattice Networks and Partial Monotonic Functions (100 citations)
- Improving the Expected Improvement Algorithm (65 citations)
- OnACID: Online Analysis of Calcium Imaging Data in Real Time (64 citations)
- Variable Importance Using Decision Trees (61 citations)
- Revenue Optimization with Approximate Bid Predictions (52 citations)
- Learning with Average Top-k Loss (50 citations)
and 26 more in the interactive map.
Sample complexity · 35 papers
- Approximation and Convergence Properties of Generative Adversarial Learning (82 citations)
- Linear regression without correspondence (50 citations)
- On the Complexity of Learning Neural Networks (35 citations)
- Communication-Efficient Distributed Learning of Discrete Distributions (21 citations)
- Information Theoretic Properties of Markov Random Fields, and their Algorithmic Applications (21 citations)
- Learning Identifiable Gaussian Bayesian Networks in Polynomial Time and Sample Complexity (21 citations)
- Revisiting Perceptron: Efficient and Label-Optimal Learning of Halfspaces (20 citations)
- Collaborative PAC Learning (19 citations)
- Learning Populations of Parameters (17 citations)
- Noise-Tolerant Interactive Learning Using Pairwise Comparisons (16 citations)
- Concentration of Multilinear Functions of the Ising Model with Applications to Network Data (14 citations)
- Eigenvalue Decay Implies Polynomial-Time Learnability for Neural Networks (13 citations)
and 23 more in the interactive map.
Kernels and regression theory · 23 papers
- Exploring Generalization in Deep Learning (450 citations)
- Information-theoretic analysis of generalization capability of learning algorithms (199 citations)
- Generalization Properties of Learning with Random Features (184 citations)
- Spectrally-normalized margin bounds for neural networks (164 citations)
- Kernel Feature Selection via Conditional Covariance Minimization (61 citations)
- Model-Powered Conditional Independence Test (41 citations)
- Hypothesis Transfer Learning via Transformation Functions (36 citations)
- Gaussian Quadrature for Kernel Features (31 citations)
- Net-Trim: Convex Pruning of Deep Neural Networks with Performance Guarantee (27 citations)
- Consistent Multitask Learning with Nonlinear Output Relations (23 citations)
- FALKON: An Optimal Large Scale Kernel Method (18 citations)
- Group Sparse Additive Machine (18 citations)
and 11 more in the interactive map.
Clustering · 16 papers
- Inhomogeneous Hypergraph Clustering with Applications (94 citations)
- Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search (78 citations)
- Clustering with Noisy Queries (59 citations)
- Clustering Billions of Reads for DNA Data Storage (38 citations)
- Query Complexity of Clustering with Side Information (38 citations)
- Hierarchical Clustering Beyond the Worst-Case (27 citations)
- Sparse Embedded $k$-Means Clustering (27 citations)
- Semisupervised Clustering, AND-Queries and Locally Encodable Source Coding (14 citations)
- Clustering Stable Instances of Euclidean k-means. (13 citations)
- On the Consistency of Quick Shift (7 citations)
- Subspace Clustering via Tangent Cones (6 citations)
- Fair Clustering Through Fairlets (1 citation)
and 4 more in the interactive map.
Submodular and game algorithms · 15 papers
- Safe and Nested Subgame Solving for Imperfect-Information Games (98 citations)
- Robust Optimization for Non-Convex Objectives (64 citations)
- Multiplicative Weights Update with Constant Step-Size in Congestion Games: Convergence, Limit Cycles and Chaos (56 citations)
- Balancing information exposure in social networks (49 citations)
- Subset Selection under Noise (41 citations)
- Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach (29 citations)
- Subset Selection and Summarization in Sequential Data (17 citations)
- Decomposable Submodular Function Minimization: Discrete and Continuous (15 citations)
- The Importance of Communities for Learning to Influence (14 citations)
- Continuous DR-submodular Maximization: Structure and Algorithms (10 citations)
- Minimizing a Submodular Function from Samples (9 citations)
- Dynamic Revenue Sharing (8 citations)
and 3 more in the interactive map.
Combinatorial and search optimization · 9 papers
- Monte-Carlo Tree Search by Best Arm Identification (24 citations)
- Inference in Graphical Models via Semidefinite Programming Hierarchies (15 citations)
- Learning Chordal Markov Networks via Branch and Bound (6 citations)
- Beyond Worst-case: A Probabilistic Analysis of Affine Policies in Dynamic Optimization (5 citations)
- Large-Scale Quadratically Constrained Quadratic Program via Low-Discrepancy Sequences (5 citations)
- Min-Max Propagation (3 citations)
- Online Dynamic Programming (2 citations)
- Linear Time Computation of Moments in Sum-Product Networks (1 citation)
- A Screening Rule for l1-Regularized Ising Model Estimation
Fairness · 6 papers
- Counterfactual Fairness (842 citations)
- On Fairness and Calibration (279 citations)
- Beyond Parity: Fairness Objectives for Collaborative Filtering (156 citations)
- When Worlds Collide: Integrating Different Counterfactual Assumptions in Fairness (128 citations)
- From Parity to Preference-based Notions of Fairness in Classification (103 citations)
- Recycling Privileged Learning and Distribution Matching for Fairness (52 citations)
